PATRICIA

swMATH17325MaRDI QIDQ29185FDOQ29185

Author name not available (Why is that?)

Official website: http://dl.acm.org/citation.cfm?id=321481

Cited In (67)

• Full-text indexes for high-throughput sequencing
• Multiple choice tries and distributed hash tables
• A subquadratic algorithm for 3XOR
• Comparative gene finding. Models, algorithms and implementation
• Space-efficient substring occurrence estimation
• Winnowing
• Colored range queries and document retrieval
• Ultra-succinct representation of ordered trees with applications
• Weighted height of random trees
• A general central limit theorem for shape parameters of \(m\)-ary tries and PATRICIA tries
• Space-efficient construction of Lempel-Ziv compressed text indexes
• A self-stabilizing hashed Patricia trie
• Fast searches in a recommendation session.
• On the variance of a class of inductive valuations of data structures for digital search
• Non-blocking Patricia tries with replace operations
• Flexible indexing of repetitive collections
• On suffix extensions in suffix trees
• Hashed Patricia trie: efficient longest prefix matching in peer-to-peer systems
• Self-indexing based on LZ77
• Algorithms for indexing highly similar DNA sequences
• Linear-size suffix tries
• Parallel construction and query of index data structures for pattern matching on square matrices
• Document listing on repetitive collections with guaranteed performance
• On compressing and indexing repetitive sequences
• Efficient query processing with reduced implicate tries
• A metric index for approximate string matching
• Random access to Fibonacci encoded files
• Optimizing registration based encryption
• The smallest automaton recognizing the subwords of a text
• Linked dynamic tries with applications to LZ-compression in sublinear time and space
• TESTAS
• Stronger Lempel-Ziv based compressed text indexing
• Pastry
• Wumpus
• Smoothed heights of tries and patricia tries
• An analytic approach to the asymptotic variance of trie statistics and related structures
• Grammar-compressed indexes with logarithmic search time
• GLIMPSE
• Quilt
• WordSpy
• AsterixDB
• Barista
• MonetDB
• Vertica
• BUbiNG
• Lorel
• Lore
• Fiona
• MicroRazerS
• r-index
• STELLAR
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees
• Self-indexed Text Compression Using Straight-Line Programs
• On building minimal automaton for subset matching queries
• I/O efficient dynamic data structures for longest prefix queries
• A compressed dynamic self-index for highly repetitive text collections
• Computing the shortest reset words of synchronizing automata
• Practical implementation of space-efficient dynamic keyword dictionaries
• Data compression for proof replay
• Efficient multiway radix search trees
• Searching subsequences
• Time-space trade-offs for Lempel-Ziv compressed indexing
• Sawja: static analysis workshop for Java
• Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
• A self-index on block trees
• Forms of representation for simple games: sizes, conversions and equivalences
• Counting Colours in Compressed Strings

This page was built for software: PATRICIA