Burrows-Wheeler transform and Sturmian words
From MaRDI portal
Publication:1007612
DOI10.1016/S0020-0190(02)00512-4zbMath1162.68511OpenAlexW2043646600MaRDI QIDQ1007612
Sabrina Mantaci, Antonio Restivo, Marinella Sciortino
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00512-4
Related Items (46)
Novel results on the number of runs of the Burrows-Wheeler-transform ⋮ The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform ⋮ Arithmetics on Suffix Arrays of Fibonacci Words ⋮ The $q$-analog of the Markoff injectivity conjecture over the language of a balanced sequence ⋮ Perfectly clustering words are primitive positive elements of the free group ⋮ Computing the original eBWT faster, simpler, and with less memory ⋮ A separation of \(\gamma\) and \(b\) via Thue-Morse words ⋮ On the structure of bispecial Sturmian words ⋮ Unnamed Item ⋮ Cyclic Complexity of Words ⋮ Partitioned factors in Christoffel and Sturmian words ⋮ Logarithmic equal-letter runs for BWT of purely morphic words ⋮ The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ Measuring the clustering effect of BWT via RLE ⋮ Bit catastrophes for the Burrows-Wheeler transform ⋮ String attractors and infinite words ⋮ Order Conditions for Languages ⋮ \(\alpha\)-words and the radix order ⋮ A note on Sturmian words ⋮ Lightweight data indexing and compression in external memory ⋮ Clustering and Arnoux-Rauzy words ⋮ Sturmian and Episturmian Words ⋮ A bijection between words and multisets of necklaces ⋮ Balance Properties and Distribution of Squares in Circular Words ⋮ A combinatorial view on string attractors ⋮ When a dollar makes a BWT ⋮ Continued fractions with $SL(2, Z)$-branches: combinatorics and entropy ⋮ Standard Sturmian words and automata minimization algorithms ⋮ From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization ⋮ An extension of the Burrows-Wheeler transform ⋮ Two Combinatorial Criteria for BWT Images ⋮ Cyclic complexity of words ⋮ On an involution of Christoffel words and Sturmian morphisms ⋮ A new combinatorial approach to sequence comparison ⋮ Balancing and clustering of words in the Burrows-Wheeler transform ⋮ BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS ⋮ A note on the Burrows-Wheeler transformation ⋮ Compressed string-matching in standard Sturmian words ⋮ Burrows-Wheeler transform and palindromic richness ⋮ Characteristic Sturmian words are extremal for the critical factorization theorem ⋮ Phylogenetic analysis of DNA sequences based on \(k\)-word and rough set theory ⋮ LZ77 computation based on the run-length encoded BWT ⋮ On quadratic numbers and forms, and Markoff theory ⋮ On Christoffel classes ⋮ The alternating BWT: an algorithmic perspective ⋮ Balanced Words Having Simple Burrows-Wheeler Transform
Cites Work
This page was built for publication: Burrows-Wheeler transform and Sturmian words
