Search For:

Displaying 1-8 out of 8 total
Reconstructing isoform graphs from RNA-Seq data
Found in: 2012 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)
By Stefano Beretta,Paola Bonizzoni,Raffaella Rizzi,Gianluca Della Vedova
Issue Date:October 2012
pp. 1-4
Next-generation sequencing (NGS) technologies allow new methodologies for alternative splicing (AS) analysis. Current computational methods for AS from NGS data are mainly focused on predicting splice site junctions or de novo assembly of full-length trans...
 
A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information
Found in: Computational Advances in Bio and Medical Sciences, IEEE International Conference on
By Yuri Pirola,Gianluca Della Vedova,Stefano Biffani,Alessandra Stella,Paola Bonizzoni
Issue Date:February 2012
pp. 1-6
In this work, we propose the MIN-RECOMBINANT HAPLOTYPE CONFIGURATION WITH BOUNDED ERRORS problem (MRHCE), which extends the original MIN-RECOMBINANT HAPLOTYPE CONFIGURATION formulation by incorporating two common characteristics of real data: errors and mi...
 
PIntron: A fast method for gene structure prediction via maximal pairings of a pattern and a text
Found in: Computational Advances in Bio and Medical Sciences, IEEE International Conference on
By Paola Bonizzoni, Gianluca Della Vedova, Yuri Pirola, Raffaella Rizzi
Issue Date:February 2011
pp. 33-39
A challenging issue in designing computational methods for predicting the gene structure into exons and introns from a cluster of transcript (EST, mRNA) sequences, is guaranteeing both accuracy and efficiency in time and space, when large clusters of over ...
 
Pure Parsimony Xor Haplotyping
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Yuri Pirola, Romeo Rizzi
Issue Date:October 2010
pp. 598-610
The haplotype resolution from xor-genotype data has been recently formulated as a new model for genetic studies [1]. The xor-genotype data is a cheaply obtainable type of data distinguishing heterozygous from homozygous sites without identifying the homozy...
 
Exemplar Longest Common Subsequence
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics
By Paola Bonizzoni, Gianluca Della Vedova, Riccardo Dondi, Guillaume Fertin, Raffaella Rizzi, St├ęphane Vialette
Issue Date:October 2007
pp. 535-543
In this paper, we investigate the computational and approximation complexity of the Exemplar Longest Common Subsequence of a set of sequences (ELCS problem), a generalization of the Longest Common Subsequence problem, where the input sequences are over the...
 
A Fast and Practical Approach to Genotype Phasing and Imputation on a Pedigree with Erroneous and Incomplete Information
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By Alessandra Stella, Gianluca Della Vedova, Paola Bonizzoni, Stefano Biffani, Yuri Pirola
Issue Date:November 2012
pp. 1582-1594
HASH(0x4f1716c)
     
Pure Parsimony Xor Haplotyping
Found in: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
By Gianluca Della Vedova, Paola Bonizzoni, Riccardo Dondi, Romeo Rizzi, Yuri Pirola
Issue Date:October 2010
pp. 598-610
The haplotype resolution from xor-genotype data has been recently formulated as a new model for genetic studies [1]. The xor-genotype data is a cheaply obtainable type of data distinguishing heterozygous from homozygous sites without identifying the homozy...
     
Optimal algorithms for local vertex quartet cleaning
Found in: Proceedings of the 2002 ACM symposium on Applied computing (SAC '02)
By Gianluca Della Vedova, H. Todd Wareham
Issue Date:March 2002
pp. 173-177
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary tree has been a focus on new criteria, particularly quartet-based methods th...
     
 1