The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
EMMA: A New Method for Computing Multiple Sequence Alignments given a Constraint Subset Alignment
Open accessPreprint — published as 10.1186/s13015-023-00247-x · Paper page
Abstract
Background: Adding sequences into an existing (possibly user-provided) alignment has multiple applications, including updating a large alignment with new data, adding sequences into a constraint alignment constructed using biological knowledge, or computing alignments in the presence of sequence length heterogeneity. Although this is a natural problem, only a few tools have been developed to use this information with high fidelity. Results: We present EMMA (Extending Multiple alignments using MAFFT-add) for the problem of adding a set of unaligned sequences into a multiple sequence alignment (i.e., a constraint alignment). EMMA builds on MAFFT-add, which is also designed to add sequences into a given constraint alignment. EMMA improves on MAFFT--add methods by using a divide-and-conquer framework to scale its most accurate version, MAFFT-linsi--add, to constraint alignments with many sequences. We show that EMMA has an accuracy advantage over other techniques for adding sequences into alignments under many realistic conditions and can scale to large datasets with high accuracy (hundreds of thousands of sequences). EMMA is available at https://github.com/c5shen/EMMA . Conclusions: EMMA is a new tool that provides high accuracy and scalability for adding sequences into an existing alignment.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Highly accurate protein structure prediction with AlphaFold
Jumper, J., Evans, R., Pritzel, A., Green, T., Figurnov, M., Ronneberger, O., Tunyasuvunakool, K., Bates, R., Žídek, A., Potapenko, A., et al. (2021) · Nature · doi:10.1038/s41586-021-03819-2 · Cited by 43,764
Flagged first, then by citations
Research works printed but not linked: 27
- 2006, Multiple sequence alignment for phylogenetic purposes, Australian Systematic Botany, 19, 479, 10.1071/SB06020 · DOI
- 10.1016/j.sbi.2007.03.001 · DOI
- 10.1186/s13059-015-0688-z · DOI
- 10.1093/bioinformatics/btad007 · DOI
- 10.1089/cmb.2021.0585 · DOI
- 10.1093/bioadv/vbad024 · DOI
- Park, M. , Warnow, T. : HMMerge: an ensemble method for multiple sequence alignment. Bioinformatics Advances, 052 (2023) · DOI
- 10.1093/bioinformatics/btw412 · DOI
- 10.1093/bioinformatics/bts578 · DOI
- 10.1093/molbev/msv333 · DOI
- 10.1093/bioinformatics/btaa992 · DOI
- 10.1089/cmb.2014.0156 · DOI
- 10.1371/journal.pone.0009490 · DOI · Paper page
- 10.1093/bioinformatics/btr553 · DOI
- 10.1126/science.1171243 · DOI
- 10.1186/1471-2105-3-2 · DOI
- 10.1093/molbev/msp098 · DOI
- 10.1093/bioinformatics/14.2.157 · DOI
- 10.1093/BIOINFORMATICS/BTAB788 · DOI
- 10.1093/bioinformatics/bty495 · DOI
- 10.1371/journal.pone.0018093 · DOI · Paper page
- 10.1021/bi050293e · DOI
- 10.1186/1471-2105-11-119 · DOI
- 10.1093/nar/gkaa913 · DOI · Paper page
- 10.1126/science.1171243 · DOI
- 10.1038/msb.2011.75 · DOI
- 10.1093/sysbio/syr095 · DOI
Metadata
- Authors
- Shen, C., Liu, B., Williams, K. P., & Warnow, T.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Sandia National Laboratories California (US)
- Corresponding author
- Warnow, Tandy
- Venue
- Algorithms for Molecular Biology
- Publisher
- openRxiv
- Published
- 2023-06-12
- Volume
- 18
- Issue
- 1
- Pages
- 21-21
- ISSN
- 1748-7188 (ISSN-L)
- PMC
- PMC10704716
- OpenAlex
- W4389430430
- Cited by
- 5
- References
- 1
- Citations by year
- 2026: 1 · 2025: 3 · 2024: 1
- FWCI
- 0.44
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- Locations
- Algorithms for Molecular Biology (publishedVersion, cc-by)
- bioRxiv (Cold Spring Harbor Laboratory) (acceptedVersion)
- PubMed Central (publishedVersion, cc-by)
- PubMed (publishedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- Funders
- National Science Foundation (2006069, NA0003525, DE‐NA0003525)
- U.S. Department of Energy (DENA0003525, NA0003525)
- National Nuclear Security Administration (NA0003525, contract DE-NA0003525, DENA-0003525)
- Laboratory Directed Research and Development (NA0003525, DE-NA0003525)
- Sandia National Laboratories (NA0003525, DE‐NA,0003525)
- Topics
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
- Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Fractal and DNA sequence analysis
- Physical Sciences › Mathematics › Theoretical Computer Science › Algorithms and Data Compression
- Keywords
- multiple sequence alignment, Emma, MAFFT, divide-and-conquer, alignment accuracy
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review