Archives

Algolab at ICCABS 2018

ICCABS 2018 is the 8th edition of a series of well-established scientific conferences aiming to bring together leading academic and industry researchers to discuss the latest advances in computational methods for bio and medical sciences. The 2018 edition was held in Las Vegas from Octtober, 18th through 20th of 2018. Simone Ciccolella presented a talk: […]

Read More

Algolab at Recomb 2018

RECOMB 2018 is the 22nd edition of a series of well-established scientific conferences bridging the areas of computational, mathematical, statistical and biological sciences.  The 2018 edition was held in  Paris from April, 21st through 24th of 2018, and was preceded by a series of satellite workshops on the 19th-20th of April. Luca Denti and Murray […]

Read More

Invited talk at CiE 2017

Gianluca Della Vedova has given the invited talk Character-based Phylogeny Construction and its Application to Tumor Evolution at the special session on Algorithms for biology at Computability in Europe 2017 in Turku (Finland).

Read More

Detection of long noncoding (lncRNA) involved in RNA-Seq isoforms

  Detection of long noncoding (lncRNA) involved in RNA-Seq isoforms, Hassan Mahmoud, DISCO, May 28, 2015 (slides). The recent discovery showed that the human and other mammalian genomes produce thousands of mRNA-like molecules namely, long noncoding RNAs (lncRNAs). Almost on a weekly basis, many biological studies detected that lncRNA is to be up or down-regulated in a […]

Read More

Covering pairs in directed acyclic graphs

Covering pairs in directed acyclic graphs, Yuri Pirola, LATA 2014 (slides). The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in different areas and that has an efficient algorithmic solution. In this paper, we study the computational complexity of […]

Read More

Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes

Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes, Yuri Pirola, ACM-BCB 2013 (slides). Computational methods for gene allele prediction have been proposed to substitute dedicated and expensive assays with cheaper in-silico analyses that operate on routinely collected data, such as SNP genotypes. Most of these methods are tailored to the needs and characteristics […]

Read More

A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information

A fast and practical approach to genotype phasing and imputation on a pedigree with erroneous and incomplete information, Yuri Pirola, ICCABS 2012 (slides). This work proposes 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 missing genotypes […]

Read More

PIntron: a fast method for gene structure prediction via maximal pairings of a pattern and a text

PIntron: a fast method for gene structure prediction via maximal pairings of a pattern and a text, Yuri Pirola, ICCABS 2011 (slides). In this work, we propose a novel pipeline for computational gene-structure prediction based on spliced alignment of expressed sequences (ESTs and mRNAs). This pipeline, called PIntron, is composed by four steps: Firstly, alternative […]

Read More