Solving the string statistics problem in time O(n log n)

Solving the string statistics problem in time O(n log n) (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Gerth Stølting Brodal , Rune B. Lyngsø , Anna Östlin , Christian N. S. Pedersen

Venue:	Proc. 29th International Colloquium on Automata, Languages, and Programming
Citations:	8 - 0 self

BibTeX

@INPROCEEDINGS{Brodal02solvingthe,
    author = {Gerth Stølting Brodal and Rune B. Lyngsø and Anna Östlin and Christian N. S. Pedersen},
    title = {Solving the string statistics problem in time O(n log n)},
    booktitle = { Proc. 29th International Colloquium on Automata, Languages, and Programming},
    year = {2002},
    pages = {728--739},
    publisher = {Springer}
}

Bookmark

OpenURL

Abstract

The string statistics problem consists of preprocessing a string of length n such that given a query pattern of length m, the maximum number of non-overlapping occurrences of the query pattern in the string can be reported efficiently...

Citations

773	Algorithms on Strings, Trees, and Sequences - Gusfield - 1997
546	Fast pattern matching in strings - Knuth, Morris, et al. - 1977
493	A space-economical suffix tree construction algorithm - MCCREIGHT - 1976
380	pattern matching algorithms - Weiner, Linear - 1973
269	On-line construction of suffix trees - Ukkonen - 1995
118	Optimal suffix tree construction with large alphabets - Farach - 1997
94	A new data structure for representing sorted lists - Huddleston, Mehlhorn - 1982
86	The equation a M = b N c P in a free group - Lyndon, Schützenberger - 1962
68	pattern matching algorithms - Linear - 1973
64	Optimal off-line detection of repetitions in a string. Theor - Apostolico, Preparata - 1983
55	A space-economical sux tree construction algorithm - McCreight - 1976
38	S.: A Simple algorithm for merging two disjoint linearly ordered lists - Hwang, Lin - 1972
35	Simple and flexible detection of contiguous repeats using a suffix tree - Stoye, Gusfield - 2002
34	A Fast Merging Algorithm - Brown, Tarjan - 1979
32	On-line construction of sux trees - Ukkonen - 1995
31	Sorting and Searching, volume 1 of Data Structures and Algorithms - Mehlhorn - 1984
22	Optimal sux tree construction with large alphabets - Farach - 1997
20	Sorting Jordan sequences in linear time using level-linked search trees, Information and Control 68 - Hoffman, Mehlhorn, et al. - 1986
19	Finding maximal pairs with bounded gap - Brodal, Lyngsø, et al. - 1999
16	F.P.: Data structures and algorithms for the string statistics problem. Algorithmica 15(5 - Apostolico, Preparata - 1996
15	Efficient detection of quasiperiodicities in strings - Apostolico, Ehrenfeucht - 1993
12	How many squares can a string contain - Fraenkel, Simpson - 1998
8	Sorting Jordan sequences in linear time using level/linked search trees. Information and Control - Hoffmann, Mehlhorn, et al. - 1986
6	Finding maximal quasiperiodicities in strings - Brodal, Pedersen - 2000
4	Optimal o#-line detection of repetitions in a string - Apostolico, Preparata - 1983
1	Solving the string statistics problem in time O(nlog n - Brodal, Lyngsø, et al. - 2002