Identifying Occurrences of Maximal Pairs in Multiple Strings

Authors:
Costas S. Iliopoulos;Christos Makris;Spyros Sioutas;Athanasios K. Tsakalidis;Kostas Tsichlas
Affiliations:
-;-;-;-;-
Venue:
CPM '02 Proceedings of the 13th Annual Symposium on Combinatorial Pattern Matching
Year:
2002

Citing 5
Cited 3

String searching algorithms

String searching algorithms
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Pattern matching algorithms

Pattern matching algorithms
A Fast Merging Algorithm

Journal of the ACM (JACM)
A guided tour to approximate string matching

ACM Computing Surveys (CSUR)

Data structuring application for string problems in biological sequences

ICCMSE '03 Proceedings of the international conference on Computational methods in sciences and engineering
Longest repeats with a block of k don't cares

Theoretical Computer Science
Algorithms for extracting motifs from biological weighted sequences

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A molecular sequence "model" is a (structured) sequence of distinct or identical strings separated by gaps; here we design and analyze efficient algorithms for variations of the "Model Matching" and "Model Identification" problems.