M. Sciortino

From MaRDI portal
Person:405566

Available identifiers

zbMath Open sciortino.marinellaMaRDI QIDQ405566

List of research outcomes





PublicationDate of PublicationType
On the impact of morphisms on BWT-runs2024-10-21Paper
New string attractor-based complexities for infinite words2024-09-30Paper
\(r\)-indexing the eBWT2024-05-24Paper
Inducing the Lyndon array2024-04-19Paper
Bit catastrophes for the Burrows-Wheeler transform2023-11-16Paper
A new class of string transformations for compressed text indexing2023-09-27Paper
The colored longest common prefix array computed via sequential scans2023-07-28Paper
String attractors and infinite words2023-07-26Paper
Logarithmic equal-letter runs for BWT of purely morphic words2022-08-11Paper
Detecting Mutations by eBWT2022-07-18Paper
A new class of searchable and provably highly compressible string transformations2022-07-18Paper
r-indexing the eBWT2022-06-15Paper
Computing the original eBWT faster, simpler, and with less memory2022-06-15Paper
Novel results on the number of runs of the Burrows-Wheeler-transform2022-03-24Paper
A combinatorial view on string attractors2020-12-16Paper
The alternating BWT: an algorithmic perspective2020-02-20Paper
Block sorting-based transformations on words: beyond the magic BWT2018-11-22Paper
On Fixed Points of the Burrows-Wheeler Transform2018-01-19Paper
Burrows-Wheeler transform and run-length enconding2017-11-15Paper
Measuring the clustering effect of BWT via RLE2017-11-06Paper
Cyclic complexity of words2017-02-09Paper
Lightweight LCP construction for very large collections of strings2016-07-15Paper
Standard Sturmian words and automata minimization algorithms2015-09-16Paper
Epichristoffel Words and Minimization of Moore Automata2015-06-26Paper
SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET2015-04-23Paper
Cyclic Complexity of Words2014-10-14Paper
Universal Lyndon Words2014-10-14Paper
Suffix array and Lyndon factorization of a text2014-09-05Paper
Words, Trees and Automata Minimization2013-09-20Paper
The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words2013-08-05Paper
Suffixes, Conjugates and Lyndon Words2013-06-28Paper
Lightweight LCP Construction for Next-Generation Sequencing Datasets2013-04-26Paper
Nondeterministic Moore automata and Brzozowski's minimization algorithm2012-08-09Paper
Nondeterministic Moore Automata and Brzozowski’s Algorithm2011-07-29Paper
Hopcroft's algorithm and tree-like automata2011-06-10Paper
A Challenging Family of Automata for Classical Minimization Algorithms2011-02-11Paper
On extremal cases of Hopcroft's algorithm2010-10-07Paper
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms2010-04-06Paper
Distance measures for biological sequences: some recent approaches2010-03-18Paper
Circular Sturmian words and Hopcroft's algorithm2009-10-09Paper
On Extremal Cases of Hopcroft’s Algorithm2009-07-09Paper
Burrows-Wheeler transform and Sturmian words2009-03-23Paper
Boosting textual compression in optimal linear time2008-12-21Paper
Hopcroft’s Algorithm and Cyclic Automata2008-11-20Paper
A new combinatorial approach to sequence comparison2008-04-11Paper
An extension of the Burrows-Wheeler transform2007-12-19Paper
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization2007-12-19Paper
Suffix Automata and Standard Sturmian Words2007-11-28Paper
Languages with mismatches2007-10-18Paper
Theoretical Computer Science2006-11-01Paper
Word assembly through minimal forbidden words2006-09-14Paper
Combinatorial Pattern Matching2005-12-14Paper
https://portal.mardi4nfdi.de/entity/Q47379222004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q44534642004-03-07Paper
https://portal.mardi4nfdi.de/entity/Q44375042003-12-02Paper
https://portal.mardi4nfdi.de/entity/Q44329762003-10-29Paper
Forbidden Factors and Fragment Assembly2002-09-18Paper
Words and forbidden factors2002-07-15Paper
Forbidden words in symbolic dynamics2000-11-16Paper
https://portal.mardi4nfdi.de/entity/Q49411732000-02-29Paper

Research outcomes over time

This page was built for person: M. Sciortino