Pages that link to "Item:Q3912479"

The following pages link to Linear Algorithm for Data Compression via String Matching (Q3912479):

Displaying 32 items.

• Order-preserving indexing (Q294954) (← links)
• Textual data compression in computational biology: algorithmic techniques (Q465689) (← links)
• Scalability and communication in parallel low-complexity lossless compression (Q626896) (← links)
• Linear-time construction of two-dimensional suffix trees (Q627547) (← links)
• On-line string matching with feedback (Q673776) (← links)
• Linear-time computation of local periods (Q703549) (← links)
• Text compression methods (Q805263) (← links)
• Finite automata based algorithms on subsequences and supersequences of degenerate strings (Q972350) (← links)
• The smallest automaton recognizing the subwords of a text (Q1063423) (← links)
• The use and usefulness of numeration systems (Q1119959) (← links)
• Data compression with factor automata (Q1190467) (← links)
• Sublinear approximate string matching and biological applications (Q1336963) (← links)
• Finding approximate repetitions under Hamming distance. (Q1401359) (← links)
• Truncated suffix trees and their application to data compression. (Q1401392) (← links)
• Lempel-Ziv data compression on parallel and distributed systems (Q1736484) (← links)
• Computing the longest previous factor (Q1761495) (← links)
• Linear time algorithms for finding and representing all the tandem repeats in a string (Q1765295) (← links)
• Optimal data compression algorithm (Q1816650) (← links)
• Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
• Block trees (Q2221797) (← links)
• Distance measures for biological sequences: some recent approaches (Q2270379) (← links)
• Minimum cost multi-product flow lines (Q2480199) (← links)
• Lempel-Ziv Factorization Revisited (Q3011840) (← links)
• Searching and encoding for infinite ordered sets (Q3933757) (← links)
• Forty Years of Text Indexing (Q4928554) (← links)
• Redundancy estimates for the Lempel–Ziv algorithm of data compression (Q4936548) (← links)
• Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space (Q5458854) (← links)
• Universal Data Compression Algorithm Based on Approximate String Matching (Q5485382) (← links)
• On-line construction of two-dimensional suffix trees (Q5906373) (← links)
• Optimal parallel suffix tree construction (Q5906825) (← links)
• Optimal encoding of non-stationary sources (Q5944439) (← links)
• Sublinear time Lempel-Ziv (LZ77) factorization (Q6545423) (← links)