Skip to main content
Passa alla visualizzazione normale.


Pari opportunità

MARINELLA SCIORTINO

Curriculum and Research

SCIORTINO MARINELLA

MARINELLA SCIORTINO

 (INFO-01/A)

Matematica e Informatica

Contacts

+3909123891080

marinella.sciortino@unipa.it

Download the curriculum in pdf file

Subjects

Academic Year Subject identification code Subject name ECTS Course of study
2024/2025 22450 INFORMATION THEORY AND DATA COMPRESSION 6 DATA, ALGORITHMS, AND MACHINE INTELLIGENCE
2024/2025 22450 INFORMATION THEORY AND DATA COMPRESSION 6 INGEGNERIA INFORMATICA
2024/2025 16161 PROGRAMMAZIONE CON LABORATORIO 9 INTELLIGENZA ARTIFICIALE

Publications

Date Title Type Record
2024 r-indexing the eBWT Articolo in rivista Go to
2024 New string attractor-based complexities for infinite words Articolo in rivista Go to
2023 A new class of string transformations for compressed text indexing Articolo in rivista Go to
2023 Proceedings of the 24th Italian Conference on Theoretical Computer Science, Palermo, Italy, September 13-15, 2023 Curatela Go to
2023 Computing matching statistics on Wheeler DFAs Contributo in atti di convegno pubblicato in volume Go to
2023 On the Impact of Morphisms on BWT-Runs Contributo in atti di convegno pubblicato in volume Go to
2023 Bit Catastrophes for the Burrows-Wheeler Transform Contributo in atti di convegno pubblicato in volume Go to
2022 Burrows-Wheeler Transform on Purely Morphic Words Contributo in atti di convegno pubblicato in volume Go to
2022 Logarithmic Equal-Letter Runs for BWT of Purely Morphic Words Contributo in atti di convegno pubblicato in volume Go to
2022 String Attractors and Infinite Words Contributo in atti di convegno pubblicato in volume Go to
2021 Computing the Original eBWT Faster, Simpler, and with Less Memory Contributo in atti di convegno pubblicato in volume Go to
2021 r-Indexing the eBWT Contributo in atti di convegno pubblicato in volume Go to
2021 Novel Results on the Number of Runs of the Burrows-Wheeler-Transform Contributo in atti di convegno pubblicato in volume Go to
2021 A combinatorial view on string attractors Articolo in rivista Go to
2020 The Alternating BWT: An algorithmic perspective Articolo in rivista Go to
2020 Variable-order reference-free variant discovery with the Burrows-Wheeler Transform Articolo in rivista Go to
2019 A new class of searchable and provably highly compressible string transformations Contributo in atti di convegno pubblicato in volume Go to
2019 SNPs detection by eBWT positional clustering Articolo in rivista Go to
2019 String attractors and combinatorics on words Contributo in atti di convegno pubblicato in volume Go to
2019 The effects of mental rotation on computational thinking Articolo in rivista Go to
2019 Inducing the Lyndon Array Contributo in atti di convegno pubblicato in volume Go to
2018 Detecting mutations by eBWT Contributo in atti di convegno pubblicato in volume Go to
2018 Block Sorting-Based Transformations on Words: Beyond the Magic BWT Contributo in atti di convegno pubblicato in volume Go to
2018 The colored longest common prefix array computed via sequential scans Contributo in atti di convegno pubblicato in volume Go to
2017 Cyclic complexity of words Articolo in rivista Go to
2017 Preface Abstract in rivista Go to
2017 Formal Languages and Automata: Models, Methods and Application. In Honour of the 70th Birthday of Antonio Restivo Preface Abstract in rivista Go to
2017 Burrows-Wheeler transform and Run-Length Enconding Capitolo o Saggio Go to
2017 Measuring the clustering effect of BWT via RLE Articolo in rivista Go to
2017 Preface Prefazione/Postfazione Go to
2017 On fixed points of the Burrows-Wheeler transform Articolo in rivista Go to
2016 Lightweight LCP construction for very large collections of strings Articolo in rivista Go to
2015 Standard Sturmian words and automata minimization algorithms Articolo in rivista Go to
2014 SORTING CONJUGATES AND SUFFIXES OF WORDS IN A MULTISET Articolo in rivista Go to
2014 Epichristoffel Words and Minimization of Moore Automata Articolo in rivista Go to
2014 Cyclic complexity of words Capitolo o Saggio Go to
2014 Universal Lyndon Words Capitolo o Saggio Go to
2014 Suffix array and Lyndon factorization of a text Articolo in rivista Go to
2013 Suffixes, Conjugates and Lyndon words Proceedings Go to
2013 Sorting suffixes of a text via its Lyndon factorization Contributo in atti di convegno pubblicato in volume Go to
2013 The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words Proceedings Go to
2013 Words, Trees and Automata Minimization Contributo in atti di convegno pubblicato in volume Go to
2012 Nondeterministic Moore automata and Brzozowski's minimization algorithm Articolo in rivista Go to
2012 Moore Automata and Epichristoffel Words Proceedings Go to
2012 Lightweight LCP Construction for Next-Generation Sequencing Datasets Capitolo o Saggio Go to
2011 Hopcroft's algorithm and tree-like automata Articolo in rivista Go to
2011 Novel Combinatorial and Information Theoretic Alignment Free Distances for Biological Data Mining Capitolo o Saggio Go to
2011 A challenging family of automata for classical minimization algorithms Proceedings Go to
2011 Nondeterministic Moore Automata and Brzozowski's Algorithm Proceedings Go to
2010 On Extremal Cases of the Hopcroft's Algorithm Articolo in rivista Go to
2009 Circular sturmian words and Hopcroft's algorithm Articolo in rivista Go to
2009 Hopcroft’s Algorithm and Tree-like Automata Altro Go to
2009 On Extremal Cases of Hopcroft’s Algorithm Capitolo o Saggio Go to
2008 A New Combinatorial Approach to Sequence Comparison Articolo in rivista Go to
2008 Distance measures for biological sequences: some recent approaches Articolo in rivista Go to
2008 Hopcroft’s Algorithm and Cyclic Automata Capitolo o Saggio Go to
2007 Languages with mismatches Articolo in rivista Go to
2007 An extension of the Burrows-Wheeler Transform Articolo in rivista Go to
2007 Circular words and automata minimization Proceedings Go to
2007 From First Principles to the Burrows and Wheeler Transform and Beyond, via Combinatorial Optimization Articolo in rivista Go to
2007 Suffix Automata and Standard Sturmian Words Contributo in atti di convegno pubblicato in volume Go to
2006 Word assembly through minimal forbidden words Articolo in rivista Go to
2005 A new sequence distance measure based on the Burrows-Wheeler Transform Proceedings Go to
2005 A New Combinatorial Approach to Sequence Comparison Capitolo o Saggio Go to
2005 Boosting Textual Compression in Optimal Linear Time Articolo in rivista Go to
2005 An extension of the Burrows Wheeler Transform and applications to sequence comparison and data compression Capitolo o Saggio Go to
2005 The Burrows-Wheeler Transform: a new tool in Combinatorics on Words Proceedings Go to
2005 An extension of the Burrows-Wheeler Transform to k words Proceedings Go to
2005 The Burrows-Wheeler Transform: from data compression to combinatorics on words Proceedings Go to
2004 Comparing Sequences by the Burrows-Wheeler Transform Proceedings Go to
2004 Permutations, Partitions and Combinatorial Compression Boosting Articolo in rivista Go to
2004 Approximate string matching: indexing and the k-mismatch problem Altro Go to
2004 Fragment assembly through minimal forbidden words Proceedings Go to