The following pages link to Marinella Sciortino (Q405566):
Displayed 50 items.
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Nondeterministic Moore automata and Brzozowski's minimization algorithm (Q442154) (← links)
- Standard Sturmian words and automata minimization algorithms (Q496057) (← links)
- Cyclic complexity of words (Q507796) (← links)
- (Q732028) (redirect page) (← links)
- Circular Sturmian words and Hopcroft's algorithm (Q732029) (← links)
- Novel results on the number of runs of the Burrows-Wheeler-transform (Q831816) (← links)
- Burrows-Wheeler transform and Sturmian words (Q1007612) (← links)
- Forbidden words in symbolic dynamics (Q1585506) (← links)
- Words and forbidden factors (Q1605329) (← links)
- Block sorting-based transformations on words: beyond the magic BWT (Q1622940) (← links)
- Measuring the clustering effect of BWT via RLE (Q1676309) (← links)
- Burrows-Wheeler transform and run-length enconding (Q1678356) (← links)
- On extremal cases of Hopcroft's algorithm (Q1959649) (← links)
- r-indexing the eBWT (Q2146118) (← links)
- Computing the original eBWT faster, simpler, and with less memory (Q2146134) (← links)
- Logarithmic equal-letter runs for BWT of purely morphic words (Q2163991) (← links)
- A combinatorial view on string attractors (Q2216440) (← links)
- Distance measures for biological sequences: some recent approaches (Q2270379) (← links)
- The alternating BWT: an algorithmic perspective (Q2297865) (← links)
- Languages with mismatches (Q2456367) (← 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)
- A new combinatorial approach to sequence comparison (Q2481558) (← links)
- Word assembly through minimal forbidden words (Q2503298) (← links)
- Lightweight LCP construction for very large collections of strings (Q2628803) (← links)
- Words, Trees and Automata Minimization (Q2849974) (← links)
- Universal Lyndon Words (Q2922009) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
- Hopcroft's algorithm and tree-like automata (Q3006159) (← links)
- A Challenging Family of Automata for Classical Minimization Algorithms (Q3073644) (← links)
- Forbidden Factors and Fragment Assembly (Q3147023) (← links)
- Hopcroft’s Algorithm and Cyclic Automata (Q3540107) (← links)
- Boosting textual compression in optimal linear time (Q3546295) (← links)
- Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms (Q3550832) (← links)
- On Extremal Cases of Hopcroft’s Algorithm (Q3637337) (← links)
- (Q4432976) (← links)
- (Q4437504) (← links)
- (Q4453464) (← links)
- On Fixed Points of the Burrows-Wheeler Transform (Q4601136) (← links)
- (Q4737922) (← links)
- Lightweight LCP Construction for Next-Generation Sequencing Datasets (Q4916913) (← links)
- (Q4941173) (← links)
- A new class of searchable and provably highly compressible string transformations (Q5088900) (← links)
- Detecting Mutations by eBWT (Q5090327) (← links)
- Nondeterministic Moore Automata and Brzozowski’s Algorithm (Q5200055) (← links)
- SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET (Q5247182) (← links)
- Epichristoffel Words and Minimization of Moore Automata (Q5259268) (← links)
- Suffixes, Conjugates and Lyndon Words (Q5300835) (← links)
- The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words (Q5326383) (← links)