Faster suffix sorting (Q2465058)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Faster suffix sorting	scientific article

Statements

scholarly article

0 references

Faster suffix sorting (English)

0 references

zbMATH Open document ID

0 references

10.1016/j.tcs.2007.07.017

0 references

N. Jesper Larsson

0 references

Kunihiko Sadakane

0 references

Theoretical Computer Science

0 references

publication date

19 December 2007

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

suffix arrays

0 references

Burrows-Wheeler transform

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.tcs.2007.07.017

0 references

0 references

0 references

Fast Lightweight Suffix Array Construction and Checking

0 references

0 references

Indexing compressed text

0 references

0 references

Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching

0 references

0 references

Algorithms and Computation

0 references

Linear work suffix array construction

0 references

0 references

0 references

Linear-Time Construction of Suffix Arrays

0 references

Space Efficient Linear Time Construction of Suffix Arrays

0 references

Suffix Arrays: A New Method for On-Line String Searches

0 references

An analysis of the Burrows—Wheeler transform

0 references

Engineering a lightweight suffix array construction algorithm

0 references

Finding the median

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2465058

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2465058&oldid=35024206"