Space-Time Tradeoffs for Longest-Common-Prefix Array Computation

Authors:
Simon J. Puglisi;Andrew Turpin
Affiliations:
School of Computer Science and Information Technology, RMIT University, Melbourne, Australia;School of Computer Science and Information Technology, RMIT University, Melbourne, Australia
Venue:
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Year:
2008

Citing 0
Cited 14

Permuted Longest-Common-Prefix Array

CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Computing the longest common prefix array based on the burrows-wheeler transform

SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
Practical compressed suffix trees

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Parameterized longest previous factor

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Parameterized longest previous factor

Theoretical Computer Science
Minimum Unique Substrings and Maximum Repeats

Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
Variations of the parameterized longest previous factor

Journal of Discrete Algorithms
Time-Space trade-offs for longest common extensions

CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
A comparison of index-based lempel-Ziv LZ77 factorization algorithms

ACM Computing Surveys (CSUR)
Computing regularities in strings: A survey

European Journal of Combinatorics
Lightweight LCP construction for next-generation sequencing datasets

WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Computing the longest common prefix array based on the Burrows-Wheeler transform

Journal of Discrete Algorithms
Faster semi-external suffix sorting

Information Processing Letters
Time-space trade-offs for longest common extensions

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this talk I will present a new direction of algorithms whichdo not use any extra working array. More formally, we want todesign efficient algorithms which require no extra array of sizedepending on input size n but use only constant ...