Finding a Length-Constrained Maximum-Density Path in a Tree
暂无分享,去创建一个
[1] Ming-Yang Kao,et al. Fast Algorithms for Finding Maximum-Density Segments of a Sequence with Applications to Bioinformatics , 2002, WABI.
[2] Ömer Egecioglu,et al. A new approach to sequence comparison: normalized sequence alignment , 2001, Bioinform..
[3] Yaw-Ling Lin,et al. Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis , 2002, J. Comput. Syst. Sci..
[4] Kun-Mao Chao,et al. Recent Developments in Linear-Space Alignment Methods: A Survey , 1994, J. Comput. Biol..
[5] W. Miller,et al. Comparison of five methods for finding conserved sequences in multiple alignments of gene regulatory regions. , 1999, Nucleic acids research.
[6] Chuan Yi Tang,et al. An Efficient Algorithm for the Length-Constrained Heaviest Path Problem on a Tree , 1999, Inf. Process. Lett..
[7] X. Huang,et al. An algorithm for identifying regions of a DNA sequence that satisfy a content requirement , 1994, Comput. Appl. Biosci..
[8] Sung Kwon Kim,et al. Linear-time algorithm for finding a maximum-density segment of a sequence , 2003, Inf. Process. Lett..
[9] M. Frommer,et al. CpG islands in vertebrate genomes. , 1987, Journal of molecular biology.
[10] Daiya Takai,et al. Comprehensive analysis of CpG islands in human chromosomes 21 and 22 , 2002, Proceedings of the National Academy of Sciences of the United States of America.
[11] A. V. Aho,et al. On Computing All Suboptimal Alignments 1 , 1997 .
[12] Yaw-Ling Lin,et al. MAVG: locating non-overlapping maximum average segments in a given sequence , 2003, Bioinform..