Skip to search formSkip to main contentSkip to account menu

Suffix array

Known as: Suffix (disambiguation) 
In computer science, a suffix array is a sorted array of all suffixes of a string. It is a data structure used, among others, in full text indices… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
Array data structureBioinformaticsBowtie (sequence analysis)Burrows–Wheeler transform

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with $p… 
2014
2014
An integrated algorithm for local sequence alignment
Local sequence alignment (LSA) is an essential part of DNA sequencing. LSA helps to identify the facts in biological identity… 
2009
2009
Counting Parameterized Border Arrays for a Binary Alphabet
The parameterized pattern matching problem is a kind of pattern matching problem, where a pattern is considered to occur in a… 
2008
2008
Suffix Array for Large Alphabet
Burrows-Wheeler Transform (BWT) is used as the main part in block compression which has a good balance of speed and compression… 
2008
2008
Algorithms for clustering expressed sequence tags: the wcd tool
Understanding which genes are active, and when and why, is an important question for molecular biology. Expressed Sequence Tags… 
2007
2007
K-Best Suffix Arrays
Suppose we have a large dictionary of strings. Each entry starts with a figure of merit (popularity). We wish to find the k-best… 
2007
2007
Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets
This article presents our divide-and-conquer optimal algorithms for lightweight suffix array construction for constant alphabets… 
2006
2006
Lookup Tables, Suffix Trees and Suffix Arrays
Iowa State University 5. 
Highly Cited
2004
Highly Cited
2004
Compressed Compact Suffix Arrays
The compact suffix array (CSA) is a space-efficient full-text index, which is fast in practice to search for patterns in a static… 
1997
1997
Distributed Generation of Suffix Arrays
An algorithm for the distributed computation of suffix arrays for large texts is presented. The parallelism model is that of a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)