The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Multiple sequence alignment using partial order graphs
Abstract
Motivation: Progressive Multiple Sequence Alignment (MSA) methods depend on reducing an MSA to a linear profile for each alignment step. However, this leads to loss of information needed for accurate alignment, and gap scoring artifacts. Results: We present a graph representation of an MSA that can itself be aligned directly by pairwise dynamic programming, eliminating the need to reduce the MSA to a profile. This enables our algorithm (Partial Order Alignment (POA)) to guarantee that the optimal alignment of each new sequence versus each sequence in the MSA will be considered. Moreover, this algorithm introduces a new edit operator, homologous recombination, important for multidomain sequences. The algorithm has improved speed (linear time complexity) over existing MSA algorithms, enabling construction of massive and complex alignments (e.g. an alignment of 5000 sequences in 4 h on a Pentium II). We demonstrate the utility of this algorithm on a family of multidomain SH2 proteins, and on EST assemblies containing alternative splicing and polymorphism. Availability: The partial order alignment program POA is available at http://www.bioinformatics.ucla.edu/poa. Contact: leec@mbi.ucla.edu * To whom correspondence should be addressed. 2 Current address: center for Applied Mathematics, 657 Rhodes Hall, Cornell University, Ithaca NY 14853, USA.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
Altschul, S. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.17.3389 · Cited by 73,302
Thompson, J. D., Higgins, D. G., & Gibson, T. J. (1994) · Nucleic Acids Research · doi:10.1093/nar/22.22.4673 · Cited by 64,617
Needleman, S. B., & Wunsch, C. D. (1970) · Journal of Molecular Biology · doi:10.1016/0022-2836(70)90057-4 · Cited by 11,288
Identification of common molecular subsequences
Smith, T. F., & Waterman, M. S. (1981) · Journal of Molecular Biology · doi:10.1016/0022-2836(81)90087-5 · Cited by 9,940
T-coffee: a novel method for fast and accurate multiple sequence alignment 1 1Edited by J. Thornton
Notredame, C., Higgins, D. G., & Heringa, J. (2000) · Journal of Molecular Biology · doi:10.1006/jmbi.2000.4042 · Cited by 6,852
CLUSTAL: a package for performing multiple sequence alignment on a microcomputer
Higgins, D. G., & Sharp, P. M. (1988) · Gene · doi:10.1016/0378-1119(88)90330-7 · Cited by 3,394
[5] Rapid and sensitive sequence comparison with FASTP and FASTA
Pearson, W. R. (1990) · Methods in Enzymology · doi:10.1016/0076-6879(90)83007-v · Cited by 1,946
Progressive sequence alignment as a prerequisitetto correct phylogenetic trees
Feng, D.-F., & Doolittle, R. F. (1987) · Journal of Molecular Evolution · doi:10.1007/bf02603120 · Cited by 1,883
Eddy, S. R. (1996) · Current Opinion in Structural Biology · doi:10.1016/s0959-440x(96)80056-x · Cited by 1,430
Genome-wide detection of alternative splicing in expressed sequences of human genes
Modrek, B. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.13.2850 · Cited by 679
A tool for multiple sequence alignment.
Lipman, D. J., Altschul, S. F., & Kececioglu, J. D. (1989) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.86.12.4412 · Cited by 506
A strategy for the rapid multiple alignment of protein sequences
Barton, G. J., & Sternberg, M. J. E. (1987) · Journal of Molecular Biology · doi:10.1016/0022-2836(87)90316-0 · Cited by 478
ESTablishing a human transcript map
Boguski, M. S., & Schuler, G. D. (1995) · Nature Genetics · doi:10.1038/ng0895-369 · Cited by 380
Automated Finishing with Autofinish
Gordon, D., Desmarais, C., & Green, P. (2001) · Genome Research · doi:10.1101/gr.171401 · Cited by 376
Gotoh, O. (1996) · Journal of Molecular Biology · doi:10.1006/jmbi.1996.0679 · Cited by 328
Multiple DNA and protein sequence alignment based on segment-to-segment comparison.
Morgenstern, B., Dress, A., & Werner, T. (1996) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.93.22.12098 · Cited by 299
Identification of protein sequence homology by consensus template alignment
Taylor, W. R. (1986) · Journal of Molecular Biology · doi:10.1016/0022-2836(86)90308-6 · Cited by 278
COFFEE: an objective function for multiple sequence alignments.
Notredame, C., Holm, L., & Higgins, D. G. (1998) · Bioinformatics · doi:10.1093/bioinformatics/14.5.407 · Cited by 231
Gap costs for multiple sequence alignment
Altschul, S. F. (1989) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(89)80196-1 · Cited by 139
Genome-wide analysis of single-nucleotide polymorphisms in human expressed sequences
Irizarry, K., Kustanovich, V., Li, C., Brown, N. B., Nelson, S. F., Wong, W. H., & Lee, C. J. (2000) · Nature Genetics · doi:10.1038/79981 · Cited by 134
Self-citationOptimal alignment between groups of sequences and its application to multiple sequence alignment
Gotoh, O. (1993) · Computer applications in the biosciences · doi:10.1093/bioinformatics/9.3.361 · Cited by 127
Alternative Gene Form Discovery and Candidate Gene Selection from Gene Indexing ProjectsPreprint
Burke, J. P., Wang, H., Hide, W., et al. (1998) · Genome Research · doi:10.1101/gr.8.3.276 · Cited by 103
A method for multiple sequence alignment with gaps
Subbiah, S., & Harrison, S. C. (1989) · Journal of Molecular Biology · doi:10.1016/0022-2836(89)90592-5 · Cited by 80
Quantifying the local reliability of a sequence alignment
Th.Mevissen, H., & Vingron, M. (1996) · Protein Engineering Design and Selection · doi:10.1093/protein/9.2.127 · Cited by 68
Single nucleotide polymorphism identification in candidate gene systems of obesity
Irizarry, K. J. L., Hu, G., Wong, M., Licinio, J., & Lee, C. (2001) · The Pharmacogenomics Journal · doi:10.1038/sj.tpj.6500042 · Cited by 14
Self-citation
Cited by
Velvet: Algorithms for de novo short read assembly using de Bruijn graphs
Zerbino, D. R., & Birney, E. (2008) · Genome Research · doi:10.1101/gr.074492.107 · Cited by 9,491
Pruesse, E., Quast, C., Knittel, K., Fuchs, B. M., Ludwig, W., Peplies, J., & Glockner, F. O. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm864 · Cited by 6,668
Mauve: Multiple alignment of conserved genomic sequence with rearrangements
Darling, A. C. E., Mau, B., Blattner, F. R., & Perna, N. T. (2004) · Genome Research · doi:10.1101/gr.2289704 · Cited by 4,949
Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data
Chin, C.-S., Alexander, D. H., Marks, P., Klammer, A. A., Drake, J., Heiner, C., Clum, A., Copeland, A., Huddleston, J., Eichler, E. E., et al. (2013) · Nature Methods · doi:10.1038/nmeth.2474 · Cited by 4,029
SINA: Accurate high-throughput multiple sequence alignment of ribosomal RNA genes
Pruesse, E., Peplies, J., & Glöckner, F. O. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts252 · Cited by 3,079
Metadata
- Authors
- Lee, C., Grasso, C., & Sharlow, M. F.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2002-03-01
- Volume
- 18
- Issue
- 3
- Pages
- 452-464
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2142113273
- Cited by
- 764
- References
- 25
- FWCI
- 7.88
- Type
- journal article
- Language
- en
- Open access
- closed
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.