Disjoint Segments with Maximum Density
Authors:
- 1 January 2005
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 845-850
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applicationsJournal of Computer and System Sciences, 2005
- Fast Optimal Genome Tiling with Applications to Microarray Design and Homology SearchJournal of Computational Biology, 2004
- Linear-time algorithm for finding a maximum-density segment of a sequenceInformation Processing Letters, 2003
- MAVG: locating non-overlapping maximum average segments in a given sequenceBioinformatics, 2003
- Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysisJournal of Computer and System Sciences, 2002
- Comprehensive analysis of CpG islands in human chromosomes 21 and 22Proceedings of the National Academy of Sciences, 2002
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphsInformation Processing Letters, 1992
- CpG islands as gene markers in the human genomeGenomics, 1992
- CpG Islands in vertebrate genomesJournal of Molecular Biology, 1987
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982