Finding recurrent sources in sequences
- 10 April 2003
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 123-130
- https://doi.org/10.1145/640075.640091
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- A local search approximation algorithm for k-means clusteringPublished by Association for Computing Machinery (ACM) ,2002
- A compact view of isochores in the draft human genome sequenceFEBS Letters, 2002
- DNA segmentation as a model selection processPublished by Association for Computing Machinery (ACM) ,2001
- DNA Segmentation Through the Bayesian ApproachJournal of Computational Biology, 2000
- Determination of the number of zones in a biostratigraphical sequenceNew Phytologist, 1996
- Stochastic models for heterogeneous DNA sequencesBulletin of Mathematical Biology, 1989
- On the Complexity of Some Common Geometric Location ProblemsSIAM Journal on Computing, 1984
- The Maximum Coverage Location ProblemSIAM Journal on Algebraic Discrete Methods, 1983
- Estimating the Dimension of a ModelThe Annals of Statistics, 1978
- On the approximation of curves by line segments using dynamic programmingCommunications of the ACM, 1961