Replacing suffix trees with enhanced suffix arrays
type: Item
instance of: scholarly article
title: Replacing suffix trees with enhanced suffix arrays
zbMATH Open document ID: 1115.92303
DOI: 10.1016/S1570-8667(03)00065-0
author: Mohamed Ibrahim Abouelhoda
author: Stefan Kurtz
author: Enno Ohlebusch
published in: Journal of Discrete Algorithms
publication date: 2007-04-26T00:00:00Z
Mathematics Subject Classification ID: 92C40
Mathematics Subject Classification ID: 92-08
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 92D20
zbMATH DE Number: 5147088
zbMATH Keywords: suffix array
zbMATH Keywords: suffix tree
zbMATH Keywords: repeat analysis
zbMATH Keywords: genome comparison
zbMATH Keywords: pattern matching
Wikidata QID: Q56485241
describes a project that uses: strmat
describes a project that uses: REPuter
describes a project that uses: MUMMER
MaRDI profile type: Publication
cites work: Q4410161
cites work: Q3690245
cites work: Q4508365
cites work: Q5501814
cites work: Sublinear approximate string matching and biological applications
cites work: An experimental study of an opportunistic index
cites work: Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
cites work: Algorithms on Strings, Trees and Sequences
cites work: Linear time algorithms for finding and representing all the tandem repeats in a string
cites work: Q4737696
cites work: Q4449231
cites work: Q4547749
cites work: Linear-Time Construction of Suffix Arrays
cites work: Space Efficient Linear Time Construction of Suffix Arrays
cites work: Suffix Arrays: A New Method for On-Line String Searches
cites work: Q5457057
cites work: Q4828936
cites work: A universal algorithm for sequential data compression
cites work: Compression of individual sequences via variable-rate coding
description: scientific article; zbMATH DE number 5147088