Paola Bonizzoni
Paola Bonizzoni
Подтвержден адрес электронной почты в домене
The complexity of multiple sequence alignment with SP-score that is a metric
P Bonizzoni, G Della Vedova
Theoretical Computer Science 259 (1-2), 63-79, 2001
The haplotyping problem: an overview of computational models and solutions
P Bonizzoni, G Della Vedova, R Dondi, J Li
Journal of Computer Science and Technology 18 (6), 675-688, 2003
Reconciling a gene tree to a species tree under the duplication cost model
P Bonizzoni, G Della Vedova, R Dondi
Theoretical computer science 347 (1-2), 36-53, 2005
ASPicDB: a database resource for alternative splicing analysis
T Castrignanò, M D’Antonio, A Anselmo, D Carrabino, A D’Onorio De Meo, ...
Bioinformatics 24 (10), 1300-1304, 2008
Lecture notes in computer science (including subseries lecture notes in artificial intelligence and lecture notes in bioinformatics)
B Crawford, C Castro, E Monfroy
conference, 2007
ASPIC: a novel method to predict the exon-intron structure of a gene that is optimally compatible to a set of transcript sequences
P Bonizzoni, R Rizzi, G Pesole
BMC bioinformatics 6 (1), 244, 2005
Experimenting an approximation algorithm for the LCS
P Bonizzoni, G Della Vedova, G Mauri
Discrete Applied Mathematics 110 (1), 13-24, 2001
ASPicDB: a database of annotated transcript and protein variants generated by alternative splicing
PL Martelli, M D’Antonio, P Bonizzoni, T Castrignano, AM D’Erchia, ...
Nucleic acids research 39 (suppl_1), D80-D85, 2010
On the approximation of correlation clustering and consensus clustering
P Bonizzoni, G Della Vedova, R Dondi, T Jiang
Journal of Computer and System Sciences 74 (5), 671-696, 2008
Exemplar longest common subsequence
P Bonizzoni, G Della Vedova, R Dondi, G Fertin, R Rizzi, S Vialette
IEEE/ACM Transactions on Computational Biology and Bioinformatics 4 (4), 535-543, 2007
HapCol: accurate and memory-efficient haplotype assembly from long reads
Y Pirola, S Zaccaria, R Dondi, GW Klau, N Pisanti, P Bonizzoni
Bioinformatics 32 (11), 1610-1617, 2016
Variants of constrained longest common subsequence
P Bonizzoni, G Della Vedova, R Dondi, Y Pirola
Information Processing Letters 110 (20), 877-881, 2010
Separating some splicing models
P Bonizzoni, C Ferretti, G Mauri, R Zizza
Information Processing Letters 79 (6), 255-259, 2001
ASPIC: a web resource for alternative splicing prediction and transcript isoforms characterization
T Castrignano, R Rizzi, IG Talamo, PDO De Meo, A Anselmo, P Bonizzoni, ...
Nucleic Acids Research 34 (suppl_2), W440-W443, 2006
An approximation algorithm for the shortest common supersequence problem: an experimental analysis
P Barone, P Bonizzoni, GD Vedova, G Mauri
Proceedings of the 2001 ACM symposium on Applied computing, 56-60, 2001
Computational methods for alternative splicing prediction.
P Bonizzoni, R Rizzi, G Pesole
Briefings in functional genomics & proteomics 5 (1), 2006
About infinite traces
P Bonizzoni, G Mauri, G Pighizzini
Università di Milano. Dipartimento di Scienze dell'Informazione, 1990
A linear-time algorithm for the perfect phylogeny haplotype problem
P Bonizzoni
Algorithmica 48 (3), 267-285, 2007
The structure of reflexive regular splicing languages via Schützenberger constants
P Bonizzoni, C De Felice, R Zizza
Theoretical Computer Science 334 (1-3), 71-98, 2005
The binary perfect phylogeny with persistent characters
P Bonizzoni, C Braghin, R Dondi, G Trucco
Theoretical computer science 454, 51-63, 2012
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20