article

Free access

A Space-Economical Suffix Tree Construction Algorithm

Author:

Edward M. McCreightAuthors Info & Claims

Journal of the ACM (JACM), Volume 23, Issue 2

Pages 262 - 272

https://doi.org/10.1145/321941.321946

Published: 01 April 1976 Publication History

PDF eReader

Abstract

A new algorithm is presented for constructing auxiliary digital search trees to aid in exact-match substring searching. This algorithm has the same asymptotic running time bound as previously published algorithms, but is more economical in space. Some implementation considerations are discussed, and new work on the modification of these search trees in response to incremental changes in the strings they index (the update problem) is presented.

References

[1]

AHO, A V., HoPcaoPr, J.E., AND ULLMAN, J.D. The Design and Analysis of Computer Agorithms. Addison-Wesley, Reading, Mass., 1974, Ch 9, pp. 317-361.

Crossref

Google Scholar

[2]

KIMBALL, R B. A rapid substring searching algorithm in speech recognition Abstracted in Conf Record, IEEE Syrup on Speech Recognition, Pittsburgh, Pa., April 1974.

Google Scholar

[3]

KNUTH, D.E. The Art of Computer Programmzng, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Mass, 1973, Ch. 6.3, pp. 490-493.

Crossref

Google Scholar

[4]

KSUTH, D.E Pattern matching in strings. Unpub. lecture notes, Trondheim, Norway, May 1973.

Google Scholar

[5]

KNUTH, D.E., MORRIS, J.H. JR., AND PRATT, V.R. Fast pattern matching in strings. Comput. Sei. Rep. STAN-CS-74-440, Stanford U., Stanford, Calif., Aug. 1974.

Google Scholar

[6]

PRATT, V R. Applications of the Weiner repetition finder. Unpub. paper, Cambridge, Mass., May 1973; rev Oct. 1973

Google Scholar

[7]

WAGNER, R.A. Order-n correction for regular languages. Comm ACM 17, 5 (May 1974), 265-268.

Crossref

Google Scholar

[8]

WEINER, P. Linear pattern matching algorlthms. Conf. Record, IEEE 14th Annual Symposium on Switching and Automata Theory, pp. 1-11.

Crossref

Google Scholar

Cited By

View all

Navarro G(2024)Computing MEMs and Relatives on Repetitive Text CollectionsACM Transactions on Algorithms10.1145/370156121:1(1-33)Online publication date: 17-Dec-2024
https://dl.acm.org/doi/10.1145/3701561
Li TJiang HZhu BWang LZhu D(2024)Flanked Block-Interchange Distance on StringsIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2024.335144021:2(301-311)Online publication date: Mar-2024
https://doi.org/10.1109/TCBB.2024.3351440
Chen LTsao CDeng JHon WSadakane K(2024)τλ-Index: Locating Rare Patterns in Similar Strings2024 Data Compression Conference (DCC)10.1109/DCC58796.2024.00031(233-242)Online publication date: 19-Mar-2024
https://doi.org/10.1109/DCC58796.2024.00031
Show More Cited By

Index Terms

A Space-Economical Suffix Tree Construction Algorithm
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
2. Theory of computation
  1. Design and analysis of algorithms
    1. Data structures design and analysis
      1. Pattern matching

Recommendations

On the sorting-complexity of suffix tree construction

The suffix tree of a string is the fundamental data structure of combinatorial pattern matching. We present a recursive technique for building suffix trees that yields optimal algorithms in different computational models. Sorting is an inherent ...
The suffix binary search tree and suffix AVL tree

Suffix trees and suffix arrays are classical data structures that are used to represent the set of suffixes of a given string, and thereby facilitate the efficient solution of various string processing problems--in particular on-line string searching. ...
A suffix tree or not a suffix tree?

In this paper we study the structure of suffix trees. Given an unlabeled tree on n nodes and suffix links of its internal nodes, we ask the question "Is a suffix tree__ __", i.e., is there a string S whose suffix tree has the same topological structure ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Journal of the ACM Volume 23, Issue 2

April 1976

176 pages

ISSN:0004-5411

EISSN:1557-735X

DOI:10.1145/321941

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1976

Published in JACM Volume 23, Issue 2

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,216
Total Citations
View Citations
6,309
Total Downloads

Downloads (Last 12 months)348
Downloads (Last 6 weeks)57

Reflects downloads up to 21 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Navarro G(2024)Computing MEMs and Relatives on Repetitive Text CollectionsACM Transactions on Algorithms10.1145/370156121:1(1-33)Online publication date: 17-Dec-2024
https://dl.acm.org/doi/10.1145/3701561
Li TJiang HZhu BWang LZhu D(2024)Flanked Block-Interchange Distance on StringsIEEE/ACM Transactions on Computational Biology and Bioinformatics10.1109/TCBB.2024.335144021:2(301-311)Online publication date: Mar-2024
https://doi.org/10.1109/TCBB.2024.3351440
Chen LTsao CDeng JHon WSadakane K(2024)τλ-Index: Locating Rare Patterns in Similar Strings2024 Data Compression Conference (DCC)10.1109/DCC58796.2024.00031(233-242)Online publication date: 19-Mar-2024
https://doi.org/10.1109/DCC58796.2024.00031
Barish RShibuya T(2024)String editing under pattern constraintsTheoretical Computer Science10.1016/j.tcs.2024.1148891022(114889)Online publication date: Dec-2024
https://doi.org/10.1016/j.tcs.2024.114889
Amir AKondratovsky ELevy A(2024)On suffix tree detectionTheoretical Computer Science10.1016/j.tcs.2024.1147281012(114728)Online publication date: Oct-2024
https://doi.org/10.1016/j.tcs.2024.114728
He ZWang JJiang MHu LZou Q(2024)Random subsequence forestsInformation Sciences: an International Journal10.1016/j.ins.2024.120478667:COnline publication date: 1-May-2024
https://dl.acm.org/doi/10.1016/j.ins.2024.120478
Chen YGan WHuang GWu YYu P(2024)Privacy-preserving federated discovery of DNA motifs with differential privacyExpert Systems with Applications10.1016/j.eswa.2024.123799249(123799)Online publication date: Sep-2024
https://doi.org/10.1016/j.eswa.2024.123799
Wang QYing M(2024)Quantum Algorithm for Lexicographically Minimal String RotationTheory of Computing Systems10.1007/s00224-023-10146-868:1(29-74)Online publication date: 1-Feb-2024
https://dl.acm.org/doi/10.1007/s00224-023-10146-8
Guo PUmboh SWirth AZobel J(2024)Online Computation of String Net FrequencyString Processing and Information Retrieval10.1007/978-3-031-72200-4_12(159-173)Online publication date: 23-Sep-2024
https://dl.acm.org/doi/10.1007/978-3-031-72200-4_12
Lee GKim JChoi MJang RLee R(2023)Review of Code Similarity and Plagiarism Detection Research StudiesApplied Sciences10.3390/app13201135813:20(11358)Online publication date: 16-Oct-2023
https://doi.org/10.3390/app132011358
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

On the sorting-complexity of suffix tree construction

The suffix binary search tree and suffix AVL tree

A suffix tree or not a suffix tree?

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations