Hard problems in similarity searching

Authors:
Christophe Moan;Irena Rusu
Affiliations:
LINA, Université de Nantes, 2, Rue de la Houssiniere, B.P. 92208, 44322 Nantes Cedex 3, France;LINA, Université de Nantes, 2, Rue de la Houssiniere, B.P. 92208, 44322 Nantes Cedex 3, France
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 7
Cited 0

Finding similar regions in many strings

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distinguishing string selection problems

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs

Theoretical Computer Science
Spelling Approximate Repeated or Common Motifs Using a Suffix Tree

LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
On the complexity of finding common approximate substrings

Theoretical Computer Science
Exact Solutions for Closest String and Related Problems

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.04

Visualization

Abstract

The Closest Substring Problem is one of the most important problems in the field of computational biology. It is stated as follows: given a set of t sequences s"1,s"2,...,s"t over an alphabet @S, and two integers k,d with d=