On the Size of DASG for Multiple Texts

Authors:
Maxime Crochemore;Zdenek Tronícek
Affiliations:
-;-
Venue:
SPIRE 2002 Proceedings of the 9th International Symposium on String Processing and Information Retrieval
Year:
2002

Citing 3
Cited 0

Searching subsequences

Theoretical Computer Science
A Practical Algorithm to Find the Best Subsequence Patterns

DS '00 Proceedings of the Third International Conference on Discovery Science
Online Construction of Subsequence Automata for Multiple Texts

SPIRE '00 Proceedings of the Seventh International Symposium on String Processing Information Retrieval (SPIRE'00)

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present a left-to-right algorithm building the automaton accepting all subsequences of a given set of strings. We prove that the number of states of this automaton can be quadratic if built on at least two texts.