Pages that link to "Item:Q1770410"

The following pages link to A note on the Burrows-Wheeler transformation (Q1770410):

Displaying 27 items.

• A linear partitioning algorithm for hybrid Lyndons using \(V\)-order (Q390899) (← links)
• A bijection between words and multisets of necklaces (Q444410) (← links)
• Binary block order Rouen transform (Q507387) (← links)
• A quick tour on suffix arrays and compressed suffix arrays (Q544881) (← links)
• Burrows-Wheeler transformations and de Bruijn words (Q714849) (← links)
• A four-stage algorithm for updating a Burrows-Wheeler transform (Q732025) (← links)
• Counting suffix arrays and strings (Q932319) (← links)
• The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform (Q1629110) (← links)
• A survey of string orderings and their application to the Burrows-Wheeler transform (Q1698705) (← links)
• Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
• On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties (Q1998861) (← links)
• Can formal languages help pangenomics to represent and analyze multiple genomes? (Q2163974) (← links)
• When a dollar makes a BWT (Q2220786) (← links)
• The alternating BWT: an algorithmic perspective (Q2297865) (← links)
• Indeterminate string factorizations and degenerate text transformations (Q2363995) (← links)
• A bijective variant of the Burrows-Wheeler transform using \(V\)-order (Q2441784) (← links)
• On the combinatorics of suffix arrays (Q2445335) (← links)
• An extension of the Burrows-Wheeler transform (Q2465062) (← links)
• A new combinatorial approach to sequence comparison (Q2481558) (← links)
• Two Combinatorial Criteria for BWT Images (Q3007642) (← links)
• String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time (Q3011844) (← links)
• Sturmian and Episturmian Words (Q3522857) (← links)
• Generic Algorithms for Factoring Strings (Q4915247) (← links)
• A new class of searchable and provably highly compressible string transformations (Q5088900) (← links)
• SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET (Q5247182) (← links)
• The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)
• A new class of string transformations for compressed text indexing (Q6053405) (← links)