Tytuł artykułu

Compact and hash based variants of the suffix array

Tytuł czasopisma

Bulletin of the Polish Academy of Sciences Technical Sciences

Rocznik

2017

Wolumin

65

Numer

No 4

Autorzy

Grabowski, S. ; Raniszewski, M.

Wydział PAN

Nauki Techniczne

Zakres

407-418

Data

2017

Identyfikator

DOI: 10.1515/bpasts-2017-0046 ; ISSN 2300-1917

Źródło

Bulletin of the Polish Academy of Sciences: Technical Sciences; 2017; 65; No 4; 407-418

Referencje

Manber (1990), Suffix arrays new method for on - line string searches st Discrete SODA, Annual SIAM Algorithms, 1. ; Schlegel (2009), ary search on modern processors th Workshop on New Hardware, Int Data Management, 27, 52. ; Moffat (2016), String search experimentation using massive data Philosophical Transactions of the of Mathematical Physical and, Royal Society Engineering Sciences, 29, 372. ; Petri (2014), Optimized succinct data structures for massive data, Soft, 44, 1. ; Kärkkäinen (1995), Suffix cactus cross between suffix tree and suffix array th, Int Combinatorial Pattern Matching, 13, 191. ; Cole (2006), Suffix trays and suffix trists : Structures for faster text indexing th Automata and Part, Int Languages Programming, 16, 358. ; Ferragina (2009), Compressed text indexes From theory to practice, null, 21, 1. ; Weiner (1973), Linear pattern matching algorithm th Switching and Automata Theory, Annual IEEE, 14, 1. ; Navarro (2007), Compressed full text indexes Article, Comput Surv, 39. ; Ferragina (2000), Opportunistic data structures with applications th Foundations of, IEEE Annual Computer Science, 20, 390. ; González (2014), Locally compressed suffix arrays Article, null, 23, 1. ; Botelho (2008), Near - Optimal Space Perfect Hashing Ph Federal University of Department of Horizonte, Algorithms Computer Science, 26. ; Kärkkäinen (2003), Simple linear work suffix array construction th Automata and, Int Languages Programming, 11, 943. ; Moffat (2013), Adding compression and blended search to a compact two - level suffix array th String Processing SPIRE, Int Information Retrieval, 24, 141. ; Sadakane (2002), Succinct representations of lcp information and improvements in the compressed suffix arrays th Discrete SODA, Annual SIAM Algorithms, 19, 225. ; Mäkinen (2000), Compact suffix array th, Int Combinatorial Pattern Matching, 11, 305. ; Mäkinen (2003), Compact suffix array a space - efficient full - text index Fund, Inform, 1. ; Grossi (2000), Compressed suffix arrays and suffix trees with applications to text indexing and string matching nd Theory of, Computing, 18, 397. ; Abouelhoda (2002), The enhanced suffix array and its applications to genome analysis nd Workshop Algorithms in, Int Bioinformatics WABI, 14, 449. ; González (2007), Compressed text indexes with fast locate th, Int Combinatorial Pattern Matching, 22, 216. ; Fischer (null), Alphabet - dependent string searching with wexponential search trees th, Int Combinatorial Pattern Matching, 17, 2015. ; Khuong (1509), Array layouts for comparison - based searching abs, null, 28, 05053. ; Kärkkäinen (2011), Fixed block compression boosting in indexes th String Processing SPIRE, Int Information Retrieval, 18, 174. ; Kurtz (2000), Space efficient linear time computation of the transformation In Kluwer Academic Publishers, Information Complexity, 375. ; Raman (2002), Succinct indexable dictionaries with applications to encodingk - ary trees and multisets th Discrete SODA, Annual SIAM Algorithms, 30, 233.