Pages that link to "Item:Q1007612"

The following pages link to Burrows-Wheeler transform and Sturmian words (Q1007612):

Displaying 47 items.

• A note on Sturmian words (Q418801) (← links)
• A bijection between words and multisets of necklaces (Q444410) (← links)
• Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
• Cyclic complexity of words (Q507796) (← links)
• Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
• \(\alpha\)-words and the radix order (Q627192) (← links)
• Characteristic Sturmian words are extremal for the critical factorization theorem (Q714825) (← links)
• LZ77 computation based on the run-length encoded BWT (Q724214) (← links)
• Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
• The Burrows-Wheeler similarity distribution between biological sequences based on Burrows-Wheeler transform (Q1629110) (← links)
• Partitioned factors in Christoffel and Sturmian words (Q1659982) (← links)
• Measuring the clustering effect of BWT via RLE (Q1676309) (← links)
• A note on the Burrows-Wheeler transformation (Q1770410) (← links)
• Phylogenetic analysis of DNA sequences based on \(k\)-word and rough set theory (Q1782617) (← links)
• On quadratic numbers and forms, and Markoff theory (Q2039516) (← links)
• Perfectly clustering words are primitive positive elements of the free group (Q2140464) (← links)
• Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
• A separation of \(\gamma\) and \(b\) via Thue-Morse words (Q2146136) (← links)
• Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
• A combinatorial view on string attractors (Q2216440) (← links)
• When a dollar makes a BWT (Q2220786) (← links)
• Compressed string-matching in standard Sturmian words (Q2271418) (← links)
• Burrows-Wheeler transform and palindromic richness (Q2271441) (← links)
• The alternating BWT: an algorithmic perspective (Q2297865) (← links)
• Lightweight data indexing and compression in external memory (Q2429367) (← links)
• From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization (Q2465055) (← links)
• An extension of the Burrows-Wheeler transform (Q2465062) (← links)
• On an involution of Christoffel words and Sturmian morphisms (Q2472847) (← links)
• A new combinatorial approach to sequence comparison (Q2481558) (← links)
• On the structure of bispecial Sturmian words (Q2637643) (← links)
• Cyclic Complexity of Words (Q2922011) (← links)
• Two Combinatorial Criteria for BWT Images (Q3007642) (← links)
• On Christoffel classes (Q3374754) (← links)
• Arithmetics on Suffix Arrays of Fibonacci Words (Q3449364) (← links)
• Sturmian and Episturmian Words (Q3522857) (← links)
• Balance Properties and Distribution of Squares in Circular Words (Q3533036) (← links)
• BALANCE PROPERTIES AND DISTRIBUTION OF SQUARES IN CIRCULAR WORDS (Q3586409) (← links)
• Balanced Words Having Simple Burrows-Wheeler Transform (Q3637245) (← links)
• Continued fractions with $SL(2, Z)$-branches: combinatorics and entropy (Q4635484) (← links)
• (Q4958948) (← links)
• The $q$-analog of the Markoff injectivity conjecture over the language of a balanced sequence (Q5052166) (← links)
• The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)
• Clustering and Arnoux-Rauzy words (Q6184901) (← links)
• On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms (Q6559402) (← links)
• New string attractor-based complexities for infinite words (Q6612124) (← links)
• On the three-distance theorem (Q6638666) (← links)
• On the number of equal-letter runs of the bijective Burrows-Wheeler transform (Q6658309) (← links)