11 - Texts
Published online by Cambridge University Press: 05 September 2016
- Type
- Chapter
- Information
- Compact Data StructuresA Practical Approach, pp. 395 - 449Publisher: Cambridge University PressPrint publication year: 2016
References
, , and (2008). The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. Springer.
(1985). The myriad virtues of subword trees. In Combinatorial Algorithms on Words, NATO ISI Series, pages 85–96. Springer-Verlag.
, , , , , , , and (2015). Fast in-memory XPath search using compressed indexes. Software Practice and Experience, 45(3), 399–434.Google Scholar
, , , , and (2014). Efficient fully-compressed sequence representations. Algorithmica, 69(1), 232–268.Google Scholar
(2014). Linear time construction of compressed text indices in compact space. In Proc. 46th ACM Symposium on Theory of Computing (STOC), pages 148–193.Google Scholar
(2015). Linear time construction of compressed text indices in compact space. CoRR, abs/1401.0936. http://arxiv.org/abs/1401.0936v2.
and (2014). Alphabet-independent compressed text indexing. ACM Transactions on Algorithms, 10(4), article 23.Google Scholar
, , , and (2013). Computing the longest common prefix array based on the Burrows-Wheeler transform. Journal of Discrete Algorithms, 18, 22–31.Google Scholar
, , and (2013). Inducing suffix and lcp arrays in external memory. In Proc. 15th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 88–102.Google Scholar
and (1994). A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation.
, , , , and (2015). Geometric BWT: compressed text indexing via sparse suffixes and range searching. Algorithmica, 71(2), 258–278.Google Scholar
and (2002). A theoretical and experimental study on the construction of suffix arrays in external memory. Algorithmica, 32(1), 1–35.Google Scholar
and (2002). Jewels of Stringology. World Scientific.
, , , and (2008). Better external memory suffix array construction. ACM Journal of Experimental Algorithmics, 12, article 3.4.Google Scholar
, , and (2000). On the sorting-complexity of suffix tree construction. Journal of the ACM, 47(6), 987–1011.Google Scholar
, , , and (2005). Boosting textual compression in optimal linear time. Journal of the ACM, 52(4), 688–713.Google Scholar
, , , and (2007). Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms, 3(2), article 20.Google Scholar
, , , and (2009a). Compressed text indexes: From theory to practice. ACM Journal of Experimental Algorithmics, 13, article 12.Google Scholar
, , , and (2009b). Compressing and indexing labeled trees, with applications. Journal of the ACM, 57(1), article 4.Google Scholar
, , and , (2012). Lightweight data indexing and compression in external memory. Algorithmica, 63(3), 707–730.Google Scholar
, , and , (2009). Faster entropy-bounded compressed suffix trees. Theoretical Computer Science, 410(51), 5354–5364.Google Scholar
, , , and (2006). When indexing equals compression: Experiments with compressing suffix arrays and applications. ACM Transactions on Algorithms, 2(4), 611–639.Google Scholar
(2011). Compressed Suffix Trees: Design, Construction, and Applications. Ph.D. thesis, Ulm University, Germany.
and (2013). Compressed suffix trees: Efficient computation and storage of lcp-values. ACM Journal of Experimental Algorithmics, 18, article 2.1.Google Scholar
, , and (2015). Improved and extended locating functionality on compressed suffix arrays. Journal of Discrete Algorithms, 32, 53–63.Google Scholar
, , , , and (2016). Faster, minuter. In Proc. 26th Data Compression Conference (DCC), pages 53–62.Google Scholar
, , and (1992). Information Retrieval: Data Structures and Algorithms, chapter 3: New indices for text: Pat trees and Pat arrays, pages 66–82. Prentice-Hall.
, , and (2014). Locally compressed suffix arrays. ACM Journal of Experimental Algorithmics, 19(1), article 1.Google Scholar
(2011). A quick tour on suffix arrays and compressed suffix arrays. Theoretical Computer Science, 412(27), 2964–2973.Google Scholar
and (2006). Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal on Computing, 35(2), 378–407.Google Scholar
, , and (2003). High-order entropy-compressed text indexes. In Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 841–850.Google Scholar
(1997). Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press.
, , , , and (2007). Aspace and time efficient algorithm for constructing compressed suffix arrays. Algorithmica, 48(1), 23–36.Google Scholar
, , and (2009). Breaking a time-and-space barrier in constructing full-text indices. SIAM Journal on Computing, 38(6), 2162–2178.Google Scholar
, , , and (2014). A practical implementation of compressed suffix arrays with applications to self-indexing. In Proc. 24th Data Compression Conference (DCC), pages 292–301.Google Scholar
, , , , , and . (2015). A data-aware FM-index. In Proc. 17th Workshop on Algorithm Engineering and Experiments (ALENEX), pages 10–23.Google Scholar
and (1999). An efficient method for in memory construction of suffix arrays. In Proc. 6th International Symposium on String Processing and Information Retrieval (SPIRE), pages 81–88.Google Scholar
(2007). Fast BWT in small space by blockwise suffix sorting. Theoretical Computer Science, 387(3), 249–257.Google Scholar
and (2014). LCP array construction in external memory. In Proc. 13th International Symposium on Experimental Algorithms (SEA), LNCS 8504, pages 412–423.Google Scholar
and (2011). Fixed block compression boosting in FM-indexes. In Proc. 18th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS 7024, pages 174–184.Google Scholar
, , and (2006). Linear work suffix array construction. Journal of the ACM, 53(6), 918–936.Google Scholar
, , and (2009). Permuted longest-common-prefix array. In Proc. 20th Annual Symposium on Combinatorial Pattern Matching (CPM), LNCS 5577, pages 181–192.Google Scholar
, , and (2014). Hybrid compression of bitvectors for the FMindex. In Proc. 24th Data Compression Conference (DCC), pages 302–311.Google Scholar
, , and (2015). Parallel external memory suffix sorting. In Proc. 26th Annual Symposium on Combinatorial Pattern Matching (CPM), LNCS 9133, pages 329–342.Google Scholar
, , , , and (2001). Linear-time longest-common-prefix computation in suffix arrays and its applications. In Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM), LNCS 2089, pages 181–192.Google Scholar
(2015). Efficient Construction of Fundamental Data Structures in Large-Scale Text Indexing. Ph.D. thesis, University of Helsinki, Finland.
, , , and (2005). Constructing suffix arrays in linear time. Journal of Discrete Algorithms, 3(2–4), 126–142.Google Scholar
and (2005). Space efficient linear time construction of suffix arrays. Journal of Discrete Algorithms, 3(2–4), 143–156.Google Scholar
and , (2008). Dynamic entropy-compressed sequences and full-text indexes. ACM Transactions on Algorithms, 4(3), article 32.Google Scholar
and (1993). Suffix arrays: a new method for on-line string searches. SIAM. Journal on Computing, 22(5), 935–948.Google Scholar
(1976). A space-economical suffix tree construction algorithm. Journal of the ACM, 23(2), 262–272.Google Scholar
(2002). Efficient algorithms for document retrieval problems. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 657–666.Google Scholar
, (2014). Spaces, trees and colors: The algorithmic landscape of document retrieval on sequences. ACM Computing Surveys, 46(4), article 52.Google Scholar
, and (2002). Flexible Pattern Matching in Strings. Cambridge University Press.
, and (2014). Fast fully-compressed suffix trees. In Proc. 24th Data Compression Conference (DCC), pages 283–291.Google Scholar
, , and (2011). Two efficient algorithms for linear time suffix array construction. IEEE Transactions on Computers, 60(10), 1471–1484.Google Scholar
(2015). Engineering Fully-Compressed Suffix Trees. MSc thesis, Karlsruhe Institute of Technology, Germany.
and (2009). A compressed enhanced suffix array supporting fast string matching. In Proc. 16th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS 5721, pages 51–62.Google Scholar
and (2009). A linear-time Burrows-Wheeler transform using induced sorting. In Proc. 16th International Symposium on String Processing and Information Retrieval (SPIRE), LNCS 5721, pages 90–101.Google Scholar
, , and (2007). Ataxonomy of suffix array construction algorithms. ACM Computing Surveys, 39(2), article 4.Google Scholar
(2002). Time-space trade-offs for compressed suffix arrays. Information Processing Letters, 82(6), 307–311.Google Scholar
, , and (2011). Fully-compressed suffix trees. ACM Transactions on Algorithms, 7(4), article 53.Google Scholar
(2002). Succinct representations o. lcp information and improvements in the compressed suffix arrays. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 225–232.Google Scholar
(2003). New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms, 48(2), 294–313.Google Scholar
(2007a). Compressed suffix trees with full functionality. Theory of Computing Systems, 41(4), 589–607.Google Scholar
(2007b). Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms, 5, 12–22.Google Scholar
and (2011). Algorithms. Addison-Wesley, 4th edition.
(2010). Sampled longest common prefix array. In Proc. 21st Annual Symposium on Combinatorial Pattern Matching (CPM), LNCS 6129, pages 227–237.Google Scholar
(1993). A generalized suffix tree and its (un)expected asymptotic behaviors. SIAM. Journal on Computiing, 22(6), 1176–1198.Google Scholar
(1973). Linear pattern matching algorithm. In Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, pages 1–11.Google Scholar