Sabrina Mantaci

Orcid: 0000-0002-9200-0520

According to our database1, Sabrina Mantaci authored at least 40 papers between 1994 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Characterization of Isometric Words based on Swap and Mismatch Distance.
CoRR, 2024

Novel XBWT-based Distance Measures for Labeled Trees.
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

A Comparison Between Similarity Measures Based on Minimal Absent Words: An Experimental Approach.
Proceedings of the 25th Italian Conference on Theoretical Computer Science, 2024

Isometric Sets of Words and Generalizations of the Fibonacci Cubes.
Proceedings of the Twenty Years of Theoretical and Practical Synergies, 2024

2023
Isometric Words Based on Swap and Mismatch Distance.
Proceedings of the Developments in Language Theory - 27th International Conference, 2023

Hypercubes and Isometric Words Based on Swap and Mismatch Distance.
Proceedings of the Descriptional Complexity of Formal Systems, 2023

2021
A combinatorial view on string attractors.
Theor. Comput. Sci., 2021

A new distance based on minimal absent words and applications to biological sequences.
CoRR, 2021

2020
Some Investigations on Similarity Measures Based on Absent Words.
Fundam. Informaticae, 2020

2019
Inducing the Lyndon Array.
Proceedings of the String Processing and Information Retrieval, 2019

String Attractors and Combinatorics on Words.
Proceedings of the 20th Italian Conference on Theoretical Computer Science, 2019

2017
Measuring the clustering effect of BWT via RLE.
Theor. Comput. Sci., 2017

Preface.
Theor. Comput. Sci., 2017

On the decomposition of prefix codes.
Theor. Comput. Sci., 2017

Preface.
Math. Struct. Comput. Sci., 2017

On Fixed Points of the Burrows-Wheeler Transform.
Fundam. Informaticae, 2017

Burrows-Wheeler Transform and Run-Length Enconding.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

2015
A Generalization of Girod's Bidirectional Decoding Method to Codes with a Finite Deciphering Delay.
Int. J. Found. Comput. Sci., 2015

2014
Suffix array and Lyndon factorization of a text.
J. Discrete Algorithms, 2014

Sorting conjugates and Suffixes of Words in a Multiset.
Int. J. Found. Comput. Sci., 2014

2013
Sorting Suffixes of a Text via its Lyndon Factorization.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Suffixes, Conjugates and Lyndon Words.
Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012
On the size of transducers for bidirectional decoding of prefix codes.
RAIRO Theor. Informatics Appl., 2012

2010
Transducers for the bidirectional decoding of prefix codes.
Theor. Comput. Sci., 2010

Balance Properties and Distribution of Squares in Circular Words.
Int. J. Found. Comput. Sci., 2010

2008
A New Combinatorial Approach to Sequence Comparison.
Theory Comput. Syst., 2008

Distance measures for biological sequences: Some recent approaches.
Int. J. Approx. Reason., 2008

2007
An extension of the Burrows-Wheeler Transform.
Theor. Comput. Sci., 2007

2005
An Extension of the Burrows Wheeler Transform to k Words.
Proceedings of the 2005 Data Compression Conference (DCC 2005), 2005

An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

2003
Burrows-Wheeler transform and Sturmian words.
Inf. Process. Lett., 2003

2001
Codes and equations on trees.
Theor. Comput. Sci., 2001

2000
Bilinear Functions and Trees over the (max, +) Semiring.
Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999
Defect Theorems for Trees.
Fundam. Informaticae, 1999

1998
Periodicities on Trees.
Theor. Comput. Sci., 1998

1997
An Algorithm for the Solution of Tree Equations.
Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

Tree Codes and Equations.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

Indecomposable prefix codes and prime trees.
Proceedings of the 3rd International Conference Developments in Language Theory, 1997

1996
Equations on Trees.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

1994
A Periodicity Theorem for Trees.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994


  Loading...