Disjoint segments with maximum density

Lecture Notes in Computer Science

Volumn 3515, Issue II, 2005, Pages 845-850

  Chen, Yen Hung ^a   Lu, Hsueh I ^b,c   Tang, Chuan Yi ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c Section 4   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PROBLEM SOLVING; POLYNOMIAL APPROXIMATION;

DISJOINT SEGMENTS; POLYNOMIAL-TIME ALGORITHMS; MAXIMUM DENSITY; POSITIVE INTEGERS;

POLYNOMIALS; PROBLEM SOLVING;

EID: 25144447690     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428848_108     Document Type: Conference Paper

References (18)

1. P. Herman, P. Bertone, B. DasGupta, M. Gerstein, M.-Y. Kao and M. Snyder: Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search. Journal of Computational Biology, 11:766-785, 2004.
2. K.-M. Chung and H.-I. Lu: An Optimal Algorithm for the Maximum-Density Segment Problem. SIAM Journal on Computing, 34:373-387, 2004.
3. R. Durbin, S. Eddy, A. Krogh, and G. Mitchison: Biological Sequence Analysis. Cambridge University Press, 1998.
4. T.-H. Fan, S. Lee, H.-I. Lu, T.-S. Tsou, T.-C. Wang, A. Yao: An Optimal Algorithm for Maximum-Sum Segment and Its Application in Bioinformatics. In Proceedings of the 8th International Conference on Implementation and Application of Automata, Lecture Notes in Computer Science 2759, 251-257, Santa Barbara, July 2003, Springer-Verlag.
5. M. Gardiner-Garden, and M. Frommer: CpG Islands in Vertebrate Genomes. Journal of Molecular Biology, 196:261-282, 1987.
6. M.H. Goldwasser, M.-Y. Kao, and H.-I. Lu: Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications. Journal of Computer and System Sciences, 70:128-144, 2005.
7. U. I. Gupta, D. T. Lee, and J. Y.-T. Leung: Efficient Algorithms for Interval Graphs and Circular-Arc Graphs, Networks 12:459-467, 1982.
8. J. Y. Hsiao, C. Y. Tang, and R. S. Chang: An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs, Information Processing Letters, 43(5):229-235, 1992.
9. X. Huang: An algorithm for Identifying Regions of a DNA Sequence That Satisfy a Content Requirement. Computer Applications in the Biosciences, 10:219-225, 1994.
10. S. K. Kim: Linear-Time Algorithm for Finding a Maximum-Density Segment of a Sequence. Information Processing Letters, 86:339-342, 2003.
11. F. Larsen, R. Gundersen, R. Lopez, and H. Prydz: CpG Islands as Gene Marker in the Human Genome. Genomics, 13:1095-1107, 1992.
12. Y.-L. Lin, T. Jiang, 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:570-586, 2002.
13. Y.-L. Lin, X. Huang, T. Jiang, K.-M. Chao: MAVG: Locating Non-overlapping Maximum Average Segments in a Given Sequence. Bioinformatics, 19:151-152, 2003.
14. A. Nekrutenko and W.-H. Li: Assessment of Compositional Heterogeneity within and between Eukaryotic Genomes. Genome Research, 10:1986-1995, 2000.
15. P. Rice, I. Longden, and A. Bleasby: EMBOSS: The European Molecular Biology Open Software Suite. Trends in Genetics, 16:276-277, 2000.
16. P. H. Sellers: Pattern Recognition in Genetic Sequences by Mismatch Density. Bulletin of Mathematical Biology, 46:501-514, 1984.
17. N. Stojanovic, L. Florea, C. Riemer, D. Gumucio, J. Slightom, M. Goodman, W. Miller, and R. Hardison: Comparison of Five Methods for Finding Conserved Sequences in Multiple Alignments of Gene Regulatory Regions. Nucleic Acids Research, 27:3899-3910, 1999.
18. D. Takai, and P.A. Jones: Comprehensive Analysis of CpG Islands in Human Chromosomes 21 and 22. Proceedings of the National Academy of Sciences, 99:3740-3745, 2002.