Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,190,744 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
Array data structure
Bioinformatics
Bowtie (sequence analysis)
Burrows–Wheeler transform
Expand
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
J. Fischer
,
D. Köppl
,
Florian Kurpicz
Annual Symposium on Combinatorial Pattern…
2016
Corpus ID: 14643986
We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with $p…
Expand
2014
2014
An integrated algorithm for local sequence alignment
Sarwar Kamal
,
Mohammad Ibrahim Khan
Network Modeling Analysis in Health Informatics…
2014
Corpus ID: 256233599
Local sequence alignment (LSA) is an essential part of DNA sequencing. LSA helps to identify the facts in biological identity…
Expand
2008
2008
Suffix Array for Large Alphabet
R. Sesták
,
J. Lánský
,
Michal Zemlicka
Data Compression Conference
2008
Corpus ID: 9611651
Burrows-Wheeler Transform (BWT) is used as the main part in block compression which has a good balance of speed and compression…
Expand
2008
2008
Algorithms for clustering expressed sequence tags: the wcd tool
S. Hazelhurst
South African Computer Journal
2008
Corpus ID: 8568876
Understanding which genes are active, and when and why, is an important question for molecular biology. Expressed Sequence Tags…
Expand
2008
2008
DCA Using Suffix Arrays
Martin Fiala
,
J. Holub
Data Compression Conference
2008
Corpus ID: 11924745
DCA (Data Compression using Antidictionaries) is a novel lossless data compression method working on bit streams presented by…
Expand
2007
2007
K-Best Suffix Arrays
Kenneth Ward Church
,
B. Thiesson
,
R. Ragno
North American Chapter of the Association for…
2007
Corpus ID: 15097374
Suppose we have a large dictionary of strings. Each entry starts with a figure of merit (popularity). We wish to find the k-best…
Expand
2006
2006
Lookup Tables, Suffix Trees and Suffix Arrays
S. Aluru
,
P. Ko
2006
Corpus ID: 14554211
Iowa State University 5.
Highly Cited
2004
Highly Cited
2004
Compressed Compact Suffix Arrays
V. Mäkinen
,
G. Navarro
Annual Symposium on Combinatorial Pattern…
2004
Corpus ID: 37971201
The compact suffix array (CSA) is a space-efficient full-text index, which is fast in practice to search for patterns in a static…
Expand
Highly Cited
2002
Highly Cited
2002
Compact Suffix Array - A Space-Efficient Full-Text Index
V. Mäkinen
Fundamenta Informaticae
2002
Corpus ID: 23802957
Suffix array is a widely used full-text index that allows fast searches on the text. It is constructed by sorting all suffixes of…
Expand
Highly Cited
1995
Highly Cited
1995
Suffix Cactus: A Cross between Suffix Tree and Suffix Array
Juha Kärkkäinen
Annual Symposium on Combinatorial Pattern…
1995
Corpus ID: 6663714
The suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and…
Expand
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)
ACCEPT & CONTINUE