Concepedia

On the complexity of finding common approximate substrings

Patricia Evans, Andrew D. Smith, H. Todd Wareham

Theoretical Computer Science · 2003 · 64 citations · 13 references

DOI

Concepts

References

13

Parameterized Complexity

Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2002 · 2.9K citations · Full text

, , +12

The Complexity of Some Problems on Subsequences and Supersequences

David Maier · Journal of the ACM · 1978 · 623 citations · Full text

, , +7

Combinatorial approaches to finding subtle signals in DNA sequences.

Pavel A. Pevzner, Sing‐Hoi Sze · PubMed · 2000 · 550 citations

, , +17

On covering problems of codes

M. Frances, Ami Litman · Theory of Computing Systems · 1997 · 251 citations

, , +8

On the Approximation of Shortest Common Supersequences and Longest Common Subsequences

Tao Jiang, Ming Li · SIAM Journal on Computing · 1995 · 212 citations

, , +14