Linear-time algorithm for finding a maximum-density segment of a sequence

Information Processing Letters

Volumn 86, Issue 6, 2003, Pages 339-342

  Kim, Sung Kwon ^a  

^a Chung Ang University   (South Korea)

Author keywords

Algorithms; Bioinformatics

Indexed keywords

ALGORITHMS; BIOCOMMUNICATIONS; DATA PROCESSING; PROBLEM SOLVING;

BIOINFORMATICS;

COMPUTER SCIENCE;

EID: 0038625317     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(03)00225-4     Document Type: Article

References (5)

1. Goldwasser M.H., Kao M.-Y., Lu H.-I. Fast algorithms for finding maximum-density segments of a sequence with applications to bioinformatics. Proceedings of the Second Annual Workshop on Algorithms in Bioinformatics (WABI 2002). Lecture Notes in Comput. Sci. 2452:2002;157-171 Springer, Berlin.
2. Ioshikhes I.P., Zhang M.Q. Large-scale human promoter mapping using CpG islands. Nature Genetics. 26:2000;61-63.
3. Lin Y.-L., Jiang T., Chao K.-M. Efficient algorithms for locating the length-constrained heaviest segments, with applications to biomolecular sequence analysis. Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science (MFCS 2002). Lecture Notes in Comput. Sci. 2420:2002;459-470 Springer, Berlin.
4. Ohler U., Niemann H., Liao G., Rubin G.M. Joint modeling of DNA sequence and physical properties to improve eukaryotic promoter recognition. Bioinformatics. 17:(S1):2001;S199-S206.
5. Preparata F.P., Shamos M.I. Computational Geometry. 1985;Springer, Berlin.