An optimal algorithm for maximum-sum segment and its application in bioinformatics. Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2759, Issue , 2003, Pages 251-257

  Fan, Tsai Hung ^a   Lee, Shufen ^b   Lu, Hsueh I ^c   Tsou, Tsung Shan ^a   Wang, Tsai Cheng ^b   Yao, Adam ^b  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

^b INSTITUTE OF BIOMEDICAL SCIENCES   (Taiwan)

^c INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248869778     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45089-0_23     Document Type: Article

References (7)

1. S.F. Altschul, W. Gish, W. Miller, E.W. Myers, and D.J. Lipman. Basic local alignment search tool. Journal of Molecular Biology, 215:403-410, 1990.
2. R. V. Davuluri, I. Grosse, and M. Q. Zhang. Computational identification of promoters and first exons in the human genome. Nature Genetics, 29:412-417, 2001.
3. S. Hannenhalli and S. Levy. Promoter prediction in the human genome. Bioinformatics, 17:S90-S96, 2001.
4. Y.-L. Lin, T. Jiang, and K.-M. Chao. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. Journal of Computer and System Sciences, 65(3):570-586, 2002.
5. The Institute for Genomic Research (TIGR). Rice repeat database. http://www.tigr.org/tdb/e2k1/osa1/blastsearch.shtml.
6. E. Ukkonen. On-line construction of suffix trees. Algorithmica, 14(3):249-260, 1995.
7. R. Y. Walder, M. R. Garrett, A.M. McClain, G. E. Beck, T. M. Brennan, N. A. Kramer, A. B. Kanis, A. L. Mark, J. P. Rapp, and V. C. Sheffield. Short tandem repeat polymorphic markers for the rat genome from marker-selected libraries associated with complex mammalian phenotypes. Mammallian Genome, 9:1013-1021, 1998.