( en | de | ru )

 

Disambiguation of "Bonizzoni, Paola"

Author of the publication

copydeleteadd this publication to your clipboard
Divide and Conquer Computation of the Multi-string BWT and LCP Array.

, , , , , and . CiE, volume 10936 of Lecture Notes in Computer Science, page 107-117. Springer, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anna-Pia Paolazzi

Domingos Paola

Paola Traverso

Paola Bozzi

Paola Belloni

 

Other publications of authors with the same name

A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters, , and . CoRR, (2009)A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings., , , , and . CoRR, (2016)Solving the Persistent Phylogeny Problem in polynomial time., , and . CoRR, (2016)Circular Languages Generated by Complete Splicing Systems and Pure Unitary Languages, , and . DCM, volume 9 of EPTCS, page 22-31. (2009)Variants of constrained longest common subsequence., , , and . Inf. Process. Lett., 110 (20): 877-881 (2010)Fingerprint Clustering with Bounded Number of Missing Values., , , and . CPM, volume 4009 of Lecture Notes in Computer Science, page 106-116. Springer, (2006)Recombinant DNA , Gene Splicing as Generative Devices of Formal Languages., , and . CiE, volume 3526 of Lecture Notes in Computer Science, page 65-67. Springer, (2005)Beyond Perfect Phylogeny: Multisample Phylogeny Reconstruction via ILP., , , and . BCB, page 1-10. ACM, (2017)Anonymizing binary and small tables is hard to approximate., , and . J. Comb. Optim., 22 (1): 97-119 (2011)Unavoidable Sets, Prefix Graphs and Regularity of Circular Splicing Languages., , , and . Fundam. Informaticae, 171 (1-4): 81-95 (2020)