Paola Bonizzoni
Orcid: 0000-0001-7289-4988Affiliations:
- University of Milano-Bicocca, Milan, Italy
According to our database1,
Paola Bonizzoni
authored at least 137 papers
between 1992 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2023
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data.
Bioinform., September, 2023
Proceedings of the String Processing and Information Retrieval, 2023
Proceedings of the Bioinformatics and Biomedical Engineering, 2023
ESGq: Alternative Splicing Events Quantification across Conditions based on Event Splicing Graphs.
Proceedings of the 23rd Conference Information Technologies, 2023
2022
Computational graph pangenomics: a tutorial on data structures and their applications.
Nat. Comput., 2022
Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches.
Inf. Sci., 2022
Proceedings of the Bioinformatics and Biomedical Engineering, 2022
Proceedings of the Developments in Language Theory - 26th International Conference, 2022
2021
BMC Bioinform., November, 2021
IEEE J. Biomed. Health Informatics, 2021
Theor. Comput. Sci., 2021
Theor. Comput. Sci., 2021
On the longest common prefix of suffixes in an inverse Lyndon factorization and other properties.
Theor. Comput. Sci., 2021
Inferring cancer progression from Single-Cell Sequencing while allowing mutation losses.
Bioinform., 2021
Triplet-based similarity score for fully multilabeled trees with poly-occurring labels.
Bioinform., 2021
Proceedings of the Algorithms and Data Structures - 17th International Symposium, 2021
Can We Replace Reads by Numeric Signatures? Lyndon Fingerprints as Representations of Sequencing Reads for Machine Learning.
Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021
2020
Fundam. Informaticae, 2020
gpps: an ILP-based approach for inferring cancer progression with mutation losses from single cell data.
BMC Bioinform., 2020
γ-TRIS: a graph-algorithm for comprehensive identification of vector genomic insertion sites.
Bioinform., 2020
Proceedings of the Language and Automata Theory and Applications, 2020
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020
2019
Does Relaxing the Infinite Sites Assumption Give Better Tumor Phylogenies? An ILP-Based Comparative Approach.
IEEE ACM Trans. Comput. Biol. Bioinform., 2019
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era.
Quant. Biol., 2019
J. Comput. Biol., 2019
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019
2018
ASGAL: aligning RNA-Seq data to a splicing graph to detect novel alternative splicing events.
BMC Bioinform., 2018
HapCHAT: adaptive haplotype assembly for efficiently leveraging high coverage in long reads.
BMC Bioinform., 2018
Adv. Appl. Math., 2018
Proceedings of the Sailing Routes in the World of Computation, 2018
2017
Theor. Comput. Sci., 2017
Proceedings of the 8th ACM International Conference on Bioinformatics, 2017
Mapping RNA-seq Data to a Transcript Graph via Approximate Pattern Matching to a Hypertext.
Proceedings of the Algorithms for Computational Biology, 2017
2016
LSG: An External-Memory Tool to Compute String Graphs for Next-Generation Sequencing Data Assembly.
J. Comput. Biol., 2016
On the Minimum Error Correction Problem for Haplotype Assembly in Diploid and Polyploid Genomes.
J. Comput. Biol., 2016
A New Lightweight Algorithm to compute the BWT and the LCP array of a Set of Strings.
CoRR, 2016
Bioinform., 2016
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016
2015
A Clustering Algorithm for Planning the Integration Process of a Large Number of Conceptual Schemas.
J. Comput. Sci. Technol., 2015
Algorithmica, 2015
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015
2014
Proceedings of the Discrete and Topological Models in Molecular Biology, 2014
J. Comput. Biol., 2014
CoRR, 2014
Bioinform., 2014
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014
Splicing Systems from Past to Future: Old and New Challenges.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014
2013
J. Comb. Optim., 2013
Algorithms, 2013
Proceedings of the ACM Conference on Bioinformatics, 2013
2012
A randomized PTAS for the minimum Consensus Clustering with a fixed number of clusters.
Theor. Comput. Sci., 2012
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012
On the parameterized complexity of the repetition free longest common subsequence problem.
Inf. Process. Lett., 2012
CoRR, 2012
PIntron: a fast method for detecting the gene structure due to alternative splicing via maximal pairings of a pattern and a text.
BMC Bioinform., 2012
Proceedings of the Unconventional Computation and Natural Computation, 2012
Proceedings of the Parameterized and Exact Computation - 7th International Symposium, 2012
Proceedings of the 2012 IEEE International Conference on Bioinformatics and Biomedicine, 2012
2011
ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing.
Nucleic Acids Res., 2011
CoRR, 2011
Haplotype Inference on Pedigrees with Recombinations, Errors, and Missing Genotypes via SAT solvers
CoRR, 2011
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011
Invited: A novel perspective in algorithmic combinatorial methods for phasing populations in a coalescent model.
Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011
Proceedings of the Developments in Language Theory - 15th International Conference, 2011
2010
A characterization of (regular) circular languages generated by monotone complete splicing systems.
Theor. Comput. Sci., 2010
Constants and label-equivalence: A decision procedure for reflexive regular splicing languages.
Theor. Comput. Sci., 2010
Nat. Comput., 2010
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010
2009
J. Comput. Biol., 2009
Proceedings of the Proceedings Fifth Workshop on Developments in Computational Models--Computational Models From Nature, 2009
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009
A PTAS for the Minimum Consensus Clustering Problem with a Fixed Number of Clusters.
Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009
Proceedings of the Algorithmic Bioprocesses, 2009
2008
J. Comput. Syst. Sci., 2008
2007
Algorithmica, 2007
2006
ASPIC: a web resource for alternative splicing prediction and transcript isoforms characterization.
Nucleic Acids Res., 2006
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
2005
Theor. Comput. Sci., 2005
Theor. Comput. Sci., 2005
Int. J. Bioinform. Res. Appl., 2005
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequences.
BMC Bioinform., 2005
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005
Proceedings of the New Computational Paradigms, 2005
2004
2003
J. Comput. Sci. Technol., 2003
A Method to Detect Gene Structure and Alternative Splice Sites by Agreeing ESTs to a Genomic Sequence.
Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003
Proceedings of the Developments in Language Theory, 7th International Conference, 2003
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003
2002
Proceedings of the Developments in Language Theory, 6th International Conference, 2002
2001
Theor. Comput. Sci., 2001
An approximation algorithm for the shortest common supersequence problem: an experimental analysis.
Proceedings of the 2001 ACM Symposium on Applied Computing (SAC), 2001
Splicing systems using merge and separate operations.
Proceedings of the Where Mathematics, 2001
2000
Int. J. Found. Comput. Sci., 2000
Proceedings of the DNA Computing, 6th International Workshop on DNA-Based Computers, 2000
1999
1995
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995
1994
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994
1992
Automata on infinite trees and rational control.
Proceedings of the Tree Automata and Languages., 1992
Recognizing sets of labelled acyclic graphs.
Proceedings of the Tree Automata and Languages., 1992