On the complexity of finding common approximate substrings
Authors:
- 1 September 2003
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 306 (1-3) , 407-430
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the Parameterized Intractability of Closest Substring and Related Problems2002
- Exact Solutions for Closest String and Related Problems2001
- Finding similar regions in many strings1999
- Parameterized Complexity1999
- On covering problems of codesTheory of Computing Systems, 1997
- On the Approximation of Shortest Common Supersequences and Longest Common SubsequencesSIAM Journal on Computing, 1995
- The parameterized complexity of sequence alignment and consensusTheoretical Computer Science, 1995
- Pattern recognition in several sequences: Consensus and alignmentBulletin of Mathematical Biology, 1984
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978