default search action
Marinella Sciortino
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j34]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino
:
r-indexing the eBWT. Inf. Comput. 298: 105155 (2024) - [j33]Julien Cassaigne, France Gheeraert, Antonio Restivo, Giuseppe Romana
New string attractor-based complexities for infinite words. J. Comb. Theory, Ser. A 208: 105936 (2024) - [c38]Danilo G. Dolce, Sabrina Mantaci, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino:
Novel XBWT-based Distance Measures for Labeled Trees. ICTCS 2024: 106-119 - [c37]Lorenzo Carfagna
Generalization of Repetitiveness Measures for Two-Dimensional Strings. SPIRE 2024: 57-72 - [i21]Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Exploring Repetitiveness Measures for Two-Dimensional Strings. CoRR abs/2404.07030 (2024) - [i20]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Bit catastrophes for the Burrows-Wheeler Transform. CoRR abs/2404.10426 (2024) - [i19]Travis Gagie, Giovanni Manzini, Gonzalo Navarro, Marinella Sciortino:
Movelet Trees. CoRR abs/2408.04537 (2024) - 2023
- [j32]Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino
A new class of string transformations for compressed text indexing. Inf. Comput. 294: 105068 (2023) - [c36]Gabriele Fici
On the Impact of Morphisms on BWT-Runs. CPM 2023: 10:1-10:18 - [c35]Alessio Conte, Nicola Cotumaccio
Computing matching statistics on Wheeler DFAs. DCC 2023: 150-159 - [c34]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana
Bit Catastrophes for the Burrows-Wheeler Transform. DLT 2023: 86-99 - [e2]Giuseppa Castiglione, Marinella Sciortino:
Proceedings of the 24th Italian Conference on Theoretical Computer Science, Palermo, Italy, September 13-15, 2023. CEUR Workshop Proceedings 3587, CEUR-WS.org 2023 [contents] - [i18]Alessio Conte, Nicola Cotumaccio
Computing matching statistics on Wheeler DFAs. CoRR abs/2301.05338 (2023) - 2022
- [c33]Andrea Frosini, Ilaria Mancini, Simone Rinaldi
Burrows-Wheeler Transform on Purely Morphic Words. DCC 2022: 452 - [c32]Andrea Frosini, Ilaria Mancini, Simone Rinaldi
Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words. DLT 2022: 139-151 - [c31]Antonio Restivo
String Attractors and Infinite Words. LATIN 2022: 426-442 - [i17]Andrea Frosini, Ilaria Mancini, Simone Rinaldi, Giuseppe Romana, Marinella Sciortino:
Logarithmic equal-letter runs for BWT of purely morphic words. CoRR abs/2202.02609 (2022) - [i16]Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
A New Class of String Transformations for Compressed Text Indexing. CoRR abs/2205.05643 (2022) - [i15]Antonio Restivo, Giuseppe Romana, Marinella Sciortino:
String Attractors and Infinite Words. CoRR abs/2206.00376 (2022) - [i14]Travis Gagie, Giovanni Manzini, Marinella Sciortino:
Teaching the Burrows-Wheeler Transform via the Positional Burrows-Wheeler Transform. CoRR abs/2208.09840 (2022) - 2021
- [j31]Sabrina Mantaci, Antonio Restivo, Giuseppe Romana
A combinatorial view on string attractors. Theor. Comput. Sci. 850: 236-248 (2021) - [c30]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM 2021: 249-262 - [c29]Christina Boucher
r-Indexing the eBWT. SPIRE 2021: 3-12 - [c28]Christina Boucher
Computing the Original eBWT Faster, Simpler, and with Less Memory. SPIRE 2021: 129-142 - [i13]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
Computing the original eBWT faster, simpler, and with less memory. CoRR abs/2106.11191 (2021) - 2020
- [j30]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
Variable-order reference-free variant discovery with the Burrows-Wheeler Transform. BMC Bioinform. 21-S(8): 260 (2020) - [j29]Raffaele Giancarlo, Giovanni Manzini
The Alternating BWT: An algorithmic perspective. Theor. Comput. Sci. 812: 230-243 (2020) - [i12]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR abs/2008.08506 (2020)
2010 – 2019
- 2019
- [j28]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone
SNPs detection by eBWT positional clustering. Algorithms Mol. Biol. 14(1): 3:1-3:13 (2019) - [j27]Giuseppe Città
The effects of mental rotation on computational thinking. Comput. Educ. 141 (2019) - [c27]Raffaele Giancarlo
A New Class of Searchable and Provably Highly Compressible String Transformations. CPM 2019: 12:1-12:12 - [c26]Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino:
String Attractors and Combinatorics on Words. ICTCS 2019: 57-71 - [c25]Felipe A. Louza
Inducing the Lyndon Array. SPIRE 2019: 138-151 - [i11]Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone, Marinella Sciortino:
A New Class of Searchable and Provably Highly Compressible String Transformations. CoRR abs/1902.01280 (2019) - [i10]Felipe A. Louza, Sabrina Mantaci, Giovanni Manzini, Marinella Sciortino, Guilherme P. Telles:
Inducing the Lyndon Array. CoRR abs/1905.12987 (2019) - [i9]Raffaele Giancarlo, Giovanni Manzini, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
The Alternating BWT: an algorithmic perspective. CoRR abs/1907.02308 (2019) - [i8]Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino:
String Attractors and Combinatorics on Words. CoRR abs/1907.04660 (2019) - 2018
- [c24]Raffaele Giancarlo, Giovanni Manzini
Block Sorting-Based Transformations on Words: Beyond the Magic BWT. DLT 2018: 1-17 - [c23]Fabio Garofalo, Giovanna Rosone, Marinella Sciortino, Davide Verzotto
The Colored Longest Common Prefix Array Computed via Sequential Scans. SPIRE 2018: 153-167 - [c22]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
Detecting Mutations by eBWT. WABI 2018: 3:1-3:15 - [i7]Nicola Prezza, Nadia Pisanti, Marinella Sciortino, Giovanna Rosone:
Detecting Mutations by eBWT. CoRR abs/1805.01876 (2018) - [i6]Fabio Garofalo, Giovanna Rosone, Marinella Sciortino, Davide Verzotto:
The colored longest common prefix array computed via sequential scans. CoRR abs/1807.07596 (2018) - 2017
- [j26]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Floriana Russo, Marinella Sciortino:
On Fixed Points of the Burrows-Wheeler Transform. Fundam. Informaticae 154(1-4): 277-288 (2017) - [j25]Julien Cassaigne, Gabriele Fici
Cyclic complexity of words. J. Comb. Theory A 145: 36-56 (2017) - [j24]Mariangiola Dezani, Sabrina Mantaci, Marinella Sciortino:
Preface. Math. Struct. Comput. Sci. 27(2): 92-93 (2017) - [j23]Dora Giammarresi, Sabrina Mantaci, Marinella Sciortino, Filippo Mignosi:
Preface. Theor. Comput. Sci. 658: 1-3 (2017) - [j22]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino, Luca Versari:
Measuring the clustering effect of BWT via RLE. Theor. Comput. Sci. 698: 79-87 (2017) - [c21]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Burrows-Wheeler Transform and Run-Length Enconding. WORDS 2017: 228-239 - [e1]Gabriele Fici, Marinella Sciortino, Rossano Venturini:
String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings. Lecture Notes in Computer Science 10508, Springer 2017, ISBN 978-3-319-67427-8 [contents] - 2016
- [j21]Anthony J. Cox, Fabio Garofalo, Giovanna Rosone, Marinella Sciortino
Lightweight LCP construction for very large collections of strings. J. Discrete Algorithms 37: 17-33 (2016) - [i5]Anthony J. Cox, Fabio Garofalo, Giovanna Rosone, Marinella Sciortino:
Lightweight LCP Construction for Very Large Collections of Strings. CoRR abs/1605.04098 (2016) - 2015
- [j20]Giusi Castiglione
Standard Sturmian words and automata minimization algorithms. Theor. Comput. Sci. 601: 58-66 (2015) - 2014
- [j19]Giusi Castiglione
Epichristoffel Words and Minimization of Moore Automata. Fundam. Informaticae 134(3-4): 319-333 (2014) - [j18]Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
Sorting conjugates and Suffixes of Words in a Multiset. Int. J. Found. Comput. Sci. 25(8): 1161- (2014) - [j17]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
Suffix array and Lyndon factorization of a text. J. Discrete Algorithms 28: 2-8 (2014) - [c20]Arturo Carpi, Gabriele Fici
Universal Lyndon Words. MFCS (1) 2014: 135-146 - [c19]Julien Cassaigne, Gabriele Fici
Cyclic Complexity of Words. MFCS (1) 2014: 159-170 - [i4]Julien Cassaigne, Gabriele Fici, Marinella Sciortino, Luca Q. Zamboni:
Cyclic Complexity of Words. CoRR abs/1402.5843 (2014) - [i3]Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. CoRR abs/1406.5895 (2014) - 2013
- [c18]Giovanna Rosone
The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words. CiE 2013: 353-364 - [c17]Giusi Castiglione, Marinella Sciortino:
Words, Trees and Automata Minimization. WORDS 2013: 18-33 - [c16]Silvia Bonomo, Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
Suffixes, Conjugates and Lyndon Words. Developments in Language Theory 2013: 131-142 - [c15]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Sorting Suffixes of a Text via its Lyndon Factorization. Stringology 2013: 119-127 - [i2]Markus J. Bauer, Anthony J. Cox, Giovanna Rosone, Marinella Sciortino:
Lightweight LCP Construction for Next-Generation Sequencing Datasets. CoRR abs/1305.0160 (2013) - [i1]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
Sorting suffixes of a text via its Lyndon Factorization. CoRR abs/1306.1366 (2013) - 2012
- [j16]Giuseppa Castiglione
Nondeterministic Moore automata and Brzozowski's minimization algorithm. Theor. Comput. Sci. 450: 81-91 (2012) - [c14]Markus J. Bauer, Anthony J. Cox, Giovanna Rosone
Lightweight LCP Construction for Next-Generation Sequencing Datasets. WABI 2012: 326-337 - 2011
- [j15]Giusi Castiglione
Hopcroft's algorithm and tree-like automata. RAIRO Theor. Informatics Appl. 45(1): 59-75 (2011) - [c13]Giusi Castiglione
Nondeterministic Moore Automata and Brzozowski's Algorithm. CIAA 2011: 88-99 - 2010
- [j14]Giusi Castiglione
On extremal cases of Hopcroft's algorithm. Theor. Comput. Sci. 411(38-39): 3414-3422 (2010) - [c12]Giusi Castiglione
A Challenging Family of Automata for Classical Minimization Algorithms. CIAA 2010: 251-260
2000 – 2009
- 2009
- [j13]Giusi Castiglione
Circular sturmian words and Hopcroft's algorithm. Theor. Comput. Sci. 410(43): 4372-4381 (2009) - [c11]Giuseppa Castiglione, Antonio Restivo, Marinella Sciortino:
Hopcroft's Algorithm and Tree-like Automata. ICTCS 2009: 75-81 - [c10]Giusi Castiglione
On Extremal Cases of Hopcroft's Algorithm. CIAA 2009: 14-23 - 2008
- [j12]Sabrina Mantaci, Antonio Restivo, Marinella Sciortino:
Distance measures for biological sequences: Some recent approaches. Int. J. Approx. Reason. 47(1): 109-124 (2008) - [j11]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
A New Combinatorial Approach to Sequence Comparison. Theory Comput. Syst. 42(3): 411-429 (2008) - [c9]Giusi Castiglione
Hopcroft's Algorithm and Cyclic Automata. LATA 2008: 172-183 - 2007
- [j10]Chiara Epifanio, Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Languages with mismatches. Theor. Comput. Sci. 385(1-3): 152-166 (2007) - [j9]Raffaele Giancarlo, Antonio Restivo, Marinella Sciortino:
From first principles to the Burrows and Wheeler transform and beyond, via combinatorial optimization. Theor. Comput. Sci. 387(3): 236-248 (2007) - [j8]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
An extension of the Burrows-Wheeler Transform. Theor. Comput. Sci. 387(3): 298-312 (2007) - [c8]Marinella Sciortino, Luca Q. Zamboni:
Suffix Automata and Standard Sturmian Words. Developments in Language Theory 2007: 382-398 - 2006
- [j7]Gabriele Fici
Word assembly through minimal forbidden words. Theor. Comput. Sci. 359(1-3): 214-230 (2006) - 2005
- [j6]Paolo Ferragina
Boosting textual compression in optimal linear time. J. ACM 52(4): 688-713 (2005) - [c7]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression. CPM 2005: 178-189 - [c6]Sabrina Mantaci, Antonio Restivo, Marinella Sciortino:
An Extension of the Burrows Wheeler Transform to k Words. DCC 2005: 469 - [c5]Sabrina Mantaci, Antonio Restivo, Giovanna Rosone
A New Combinatorial Approach to Sequence Comparison. ICTCS 2005: 348-359 - 2003
- [j5]Marie-Pierre Béal, Maxime Crochemore, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Computing forbidden words of regular languages. Fundam. Informaticae 56(1-2): 121-135 (2003) - [j4]Sabrina Mantaci, Antonio Restivo, Marinella Sciortino:
Burrows-Wheeler transform and Sturmian words. Inf. Process. Lett. 86(5): 241-246 (2003) - [c4]Alessandra Gabriele, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Indexing Structures for Approximate String Matching. CIAC 2003: 140-151 - [c3]Raffaele Giancarlo, Marinella Sciortino:
Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms. CPM 2003: 129-143 - 2002
- [j3]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Words and forbidden factors. Theor. Comput. Sci. 273(1-2): 99-117 (2002) - 2001
- [j2]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. RAIRO Theor. Informatics Appl. 35(6): 565-577 (2001) - [c2]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors and Fragment Assembly. Developments in Language Theory 2001: 349-358 - 2000
- [j1]Marie-Pierre Béal, Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Words in Symbolic Dynamics. Adv. Appl. Math. 25(2): 163-193 (2000)
1990 – 1999
- 1999
- [c1]Filippo Mignosi, Antonio Restivo, Marinella Sciortino:
Forbidden Factors in Finite and Infinite Words. Jewels are Forever 1999: 339-350
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: