On the closest string and substring problems
Top Cited Papers
- 1 March 2002
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 49 (2) , 157-171
- https://doi.org/10.1145/506147.506150
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- A Polynomial Time Approximation Scheme for the Closest Substring ProblemPublished by Springer Nature ,2000
- On covering problems of codesTheory of Computing Systems, 1997
- Banishing bias from consensus sequencesPublished by Springer Nature ,1997
- A workbench for multiple alignment construction and analysisProteins-Structure Function and Bioinformatics, 1991
- An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequencesProteins-Structure Function and Bioinformatics, 1990
- Predictive motifs derived from cytosine methyltransferasesNucleic Acids Research, 1989
- Probabilistic construction of deterministic algorithms: Approximating packing integer programsJournal of Computer and System Sciences, 1988
- Multiple sequence alignment by consensusNucleic Acids Research, 1986
- Pattern recognition in several sequences: Consensus and alignmentBulletin of Mathematical Biology, 1984
- Line geometries for sequence comparisonsBulletin of Mathematical Biology, 1984