Online construction of subsequence automata for multiple texts

H. Hoshino, A. Shinohara, M. Takeda, S. Arikawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

Abstract

We consider a deterministic finite automaton which accepts all subsequences of a set of texts, called subsequence automaton. We show an online algorithm for constructing a subsequence automaton for a set of texts. It runs in O(|Σ|(m + k) + N) time using O(|Σ|m) space, where |Σ| is the size of alphabet, m is the size of the resulting subsequence automaton, k is the number of texts, and N is the total length of texts. It can be used to preprocess a given set S of texts in such a way that for any query ω ∈ Σ∗, returns in O(|ω|) time the number of texts in S which contain ω as a subsequence. We also show an upper bound of the size of automaton compared to the minimum automaton.

Original languageEnglish
Title of host publicationProceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages146-152
Number of pages7
ISBN (Electronic)0769507468, 9780769507460
DOIs
Publication statusPublished - Jan 1 2000
Event7th International Symposium on String Processing and Information Retrieval, SPIRE 2000 - A Curuna, Spain
Duration: Sep 27 2000Sep 29 2000

Publication series

NameProceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000

Other

Other7th International Symposium on String Processing and Information Retrieval, SPIRE 2000
CountrySpain
CityA Curuna
Period9/27/009/29/00

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Signal Processing
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Online construction of subsequence automata for multiple texts'. Together they form a unique fingerprint.

  • Cite this

    Hoshino, H., Shinohara, A., Takeda, M., & Arikawa, S. (2000). Online construction of subsequence automata for multiple texts. In Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000 (pp. 146-152). [878190] (Proceedings - 7th International Symposium on String Processing and Information Retrieval, SPIRE 2000). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SPIRE.2000.878190