activity
20052025
most citedVariants of Constrained Longest Common Subsequence

37 citations · 126 across the 25 of their papers we have counts for

collaborators
Showing cs.FLShow all

5 papers · 1 filter

cs.FL2024

Unveiling the connection between the Lyndon factorization and the Canonical Inverse Lyndon factorization via a border property

Paola Bonizzoni, Clelia De Felice, Brian Riccardi +2

The notion of Lyndon word and Lyndon factorization has shown to have unexpected applications in theory as well in developing novel algorithms on words. A counterpart to these notio…

cs.FL2019★ 6 cited

Lyndon words versus inverse Lyndon words: queries on suffixes and bordered words

Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino +1

Lyndon words have been largely investigated and showned to be a useful tool to prove interesting combinatorial properties of words. In this paper we state new properties of both Ly…

cs.FL2017★ 20 cited

Inverse Lyndon words and Inverse Lyndon factorizations of words

Paola Bonizzoni, Clelia De Felice, Rocco Zaccagnino +1

Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, a…

cs.FL2015★ 2 cited

Splicing Systems from Past to Future: Old and New Challenges

Luc Boasson, Paola Bonizzoni, Clelia De Felice +4

A splicing system is a formal model of a recombinant behaviour of sets of double stranded DNA molecules when acted on by restriction enzymes and ligase. In this survey we will conc…

cs.FL2009★ 3 cited

Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages

Paola Bonizzoni, Clelia De Felice, Rosalba Zizza

Circular splicing systems are a formal model of a generative mechanism of circular words, inspired by a recombinant behaviour of circular DNA. Some unanswered questions are related…