Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis

Journal of Computer and System Sciences

Volumn 65, Issue 3, 2002, Pages 570-586

  Lin, Yaw Ling ^a   Jiang, Tao ^b   Chao, Kun Mao ^c  

^a PROVIDENCE UNIVERSITY   (Taiwan)

^b United States   (United States)

^c NATIONAL YANG MING UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Biomolecular sequence analysis; Efficiency; Length constraint; Maximum consecutive subsequence; Ungapped local alignment

Indexed keywords

ALGORITHMS; BIOTECHNOLOGY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPHIC METHODS; OPTIMIZATION; TREES (MATHEMATICS);

BIOMOLECULAR SEQUENCE ANALYSIS; EVOLUTIONARY DISTANCE; LENGHT-CONSTRAINED HEAVIEST SEGMENTS; PROTEIN MOLECULES;

PROBLEM SOLVING;

EID: 23844487447     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/S0022-0000(02)00010-7     Document Type: Article

References (24)

1. N.N. Alexandrov, V.V. Solovyev, Statistical significance of ungapped alignments. Pacific Symposium on Biocomputing (PSB-98), Hawaii, 1998, pp. 463-472.
2. A. Arslan, Ö. Eǧecioǧlu, Algorithms for local alignments with length constraints, Proceedings of Latin American Theoretical Informatics (LATIN 02), Cancun, Mexico, April, 2002, pp. 38-51.
3. A. Arslan, Ö. Eǧecioǧlu, P. Pevzner, A new approach to sequence comparison: normalized sequence alignment, Bioinformatics 17 (2001) 327-337.
4. V. Bafna, D.H. Huson, The conserved exon method for gene finding, Proceedings of the International Conference on Intelligent Systems in Molecular Biology (ISMB), Vol. 8, 2000, pp. 3-12.
5. S. Batzoglou, L. Pachter, J. Mesirov, B. Berger, E. Lander, Comparative analysis of mouse and human DNA and applications to exon prediction, Proceedings of the International Conference on Computers in Molecular Biology (RECOMB), Vol. 4, 2000.
6. J. Bentley, Programming Pearls, Addison-Wesley, Reading, MA, 1986.
7. M.S. Boguski, R.C. Hardison, S. Schwartz, W. Miller, Analysis of conserved domains and sequence motifs in cellular regulatory proteins and locus control regions using new software tools for multiple alignment and visualization, New Biol. 4 (1992) 247-260.
8. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, MIT Press, Cambridge, 1990.
9. M. Gardiner-Garden, M. Frommer, CpG islands in vertebrate genomes, J. Mol. Biol. 196 (1987) 261-282.
10. S. Hannenhalli, S. Levy, Promoter prediction in the human genome, Bioinformatics 17 (2001) S90-S96.
11. R.C. Hardison, D. Krane, C. Vandenbergh, J.-F.F. Cheng, J. Mansberger, J. Taddie, S. Schwartz, X. Huang, W. Miller, Sequence and comparative analysis of the rabbit alpha-like globin gene cluster reveals a rapid mode of evolution in a G + C rich region of mammalian genomes, J. Mol. Biol. 222 (1991) 233-249.
12. R.C. Hardison, J.L. Slighton, D.L. Gumucio, M. Goodman, N. Stojanovic, W. Miller, Locus control regions of mammalian beta-globin gene clusters: combining phylogenetic analyses and experimental results to gain functional insights, Gene 205 (1997) 73-94.
13. X. Huang, An algorithm for identifying regions of a DNA sequence that satisfy a content requirement, CABIOS 10 (1994) 219-225.
14. F. Larsen, R. Gundersen, R. Lopez, H. Prydz, CpG islands as gene marker in the human genome, Genomics 13 (1992) 1095-1107.
15. A. Nekrutenko, W.-H. Li, Assessment of compositional heterogeneity within and between eukaryotic genomes, Genome Res. 10 (2000) 1986-1995.
16. P.S. Novichkov, M.S. Gelfand, A.A. Mironov, Prediction of the exon-intron structure by comparison sequences, Mol. Biol. 34 (2000) 200-206.
17. P. Rice, I. Longden, A. Bleasby, EMBOSS: the European molecular biology open software suite, Trends Genet. 16 (2000) 276-277.
18. P.H. Sellers, Pattern recognition in genetic sequences by mismatch density, Bull. Math. Biol. 46 (1984) 501-514.
19. T.F. Smith, M.S. Waterman, The identification of common molecular subsequences, J. Mol. Biol. 147 (1981) 195-197.
20. N. Stojanovic, L. Florea, C. Riemer, D. Gumucio, J. Slightom, M. Goodman, W. Miller, R. Hardison, Comparison of five method for finding conserved sequences in multiple alignments of gene regulatory regions, Nucl. Acids Res. 27 (1999) 3899-3910.
21. M.S. Waterman, M. Eggert, A new algorithm for best sequence alignments with application to tRNA-rRNA comparisons, J. Mol. Biol. 197 (1987) 723-728.
22. B.Y. Wu, K.-M. Chao, C.Y. Tang, An efficient algorithm for the length-constrained heaviest path problem on a tree, Inform. Process. Lett. 69 (1999) 63-67.
23. Z. Zhang, P. Berman, W. Miller, Alignments without low-scoring regions, J. Comput. Biol. 5 (1998) 197-200.
24. Z. Zhang, P. Berman, T. Wiehe, W. Miller, Post-processing long pair-wise alignments, Bioinformatics 15 (1999) 1012-1019.