Fast and space-efficient location of heavy or dense segments in run-length encoded sequences (extended abstract)

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

Volumn 2697, Issue , 2003, Pages 528-536

  Greenberg, Ronald I ^a  

^a LOYOLA UNIVERSITY CHICAGO   (United States)

Author keywords

Bioinformatics; Biomolecular sequence analysis; Data compression; Image processing; Maximum consecutive subsequence sum; Maximum density segments

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; COMPUTER SCIENCE; COMPUTERS; DATA COMPRESSION; IMAGE PROCESSING;

BIOMOLECULAR SEQUENCE ANALYSIS; ENCODED SEQUENCES; EXTENDED ABSTRACTS; MAXIMUM CONSECUTIVE SUBSEQUENCE SUM; MAXIMUM-DENSITY SEGMENT; OPTIMAL VALUES; OPTIMIZATION PROBLEMS; SPACE EFFICIENT;

IMAGE ANALYSIS;

EID: 21144435033     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_53     Document Type: Article

References (12)

1. Goldwasser, M.H., Kao, M.Y., Lu, H.I.: Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications. Manuscript available at http://www.cs.luc.edu/~mhg/publications/DensityPreprint.pdf (2002)
2. Goldwasser, M.H., Kao, M.Y., Lu, H.I.: Fast algorithms for finding maximum-density segments of a sequence with applications to bioinformatics. In: Proc. of the Second Annual Workshop on Algorithms in Bioinformatics, Springer-Verlag (2002) 157-171
3. Ling Lin, Y., Jiang, T., Mao Chao, K.: Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis. In: 27th International Symposium on Mathematical Foundations of Computer Science. Volume 2420 of Lecture Notes in Computer Science., Springer-Verlag (2002) 459-470
4. To appear in Journal of Computer and System Sciences.
5. Huang, X.: An algorithm for identifying regions of a DNA sequence that satisfy a content requirement. Computer Applications in the Biosciences 10 (1994) 219-225
6. Bentley, J.: Programming Pearls. Second edn. Addison-Wesley (2000)
7. Hannenhalli, S., Levy, S.: Promoter prediction in the human genome. Bioinformatics 17 (2001) S90-96
8. Nekrutenko, A., Li, W.H.: Assessment of compositional heterogeneity within and between eukaryotic genomes. Genome Research 10 (2000) 1986-1995
9. Larsen, F., Gundersen, R., Lopez, R., Prydz, H.: CpG islands as gene marker in the human genome. Genomics 13 (1992) 1095-1107
10. Hardison, R.C., Krane, D., Vandenbergh, C., Cheng, J.F.F., Mansberger, J., Taddie, J., Schwartz, S., Huang, X., Miller, W.: Sequence and comparative analysis of the rabbit alpha-like globin gene cluster reveals a rapid mode of evolution in a C+G rich region of mammalian genomes. Journal of Molecular Biology 222 (1991) 233-249
11. Gardiner-Garden, M., Frommer, M.: CpG islands in vertebrate genomes. Journal of Molecular Biology 196 (1987) 261-282
12. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. Second edn. McGraw-Hill (2001)