Yuri Pirola

Orcid: 0000-0002-8479-7592

Affiliations:
  • University of Milano-Bicocca, Milan, Italy


According to our database1, Yuri Pirola authored at least 45 papers between 2006 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Multiallelic Maximal Perfect Haplotype Blocks with Wildcards via PBWT.
Proceedings of the Bioinformatics and Biomedical Engineering, 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

KFinger: Capturing Overlaps Between Long Reads by Using Lyndon Fingerprints.
Proceedings of the Bioinformatics and Biomedical Engineering, 2022

Can Formal Languages Help Pangenomics to Represent and Analyze Multiple Genomes?
Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021
MALVIRUS: an integrated application for viral variant analysis.
BMC Bioinform., November, 2021

Computing the multi-string BWT and LCP array in external memory.
Theor. Comput. Sci., 2021

Shark: fishing relevant reads in an RNA-Seq sample.
Bioinform., 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
γ-TRIS: a graph-algorithm for comprehensive identification of vector genomic insertion sites.
Bioinform., 2020

2019
Overlap graphs and de Bruijn graphs: data structures for de novo genome assembly in the big data era.
Quant. Biol., 2019

Multithread Multistring Burrows-Wheeler Transform and Longest Common Prefix Array.
J. Comput. Biol., 2019

2018
Divide and Conquer Computation of the Multi-string BWT and LCP Array.
Proceedings of the Sailing Routes in the World of Computation, 2018

2017
FSG: Fast String Graph Construction for De Novo Assembly.
J. Comput. Biol., 2017

Computing the BWT and LCP array of a Set of Strings in External Memory.
CoRR, 2017

An External-Memory Algorithm for String Graph Construction.
Algorithmica, 2017

2016
Beyond Evolutionary Trees.
Encyclopedia of Algorithms, 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

HapCol: accurate and memory-efficient haplotype assembly from long reads.
Bioinform., 2016

FSG: Fast String Graph Construction for De Novo Assembly of Reads Data.
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

Covering Pairs in Directed Acyclic Graphs.
Comput. J., 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
Modeling Alternative Splicing Variants from RNA-Seq Data with Isoform Graphs.
J. Comput. Biol., 2014

Constructing String Graphs in External Memory.
Proceedings of the Algorithms in Bioinformatics - 14th International Workshop, 2014

2013
Parameterized complexity of k-anonymity: hardness and tractability.
J. Comb. Optim., 2013

Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability.
Algorithms, 2013

Haplotype-based prediction of gene alleles using pedigrees and SNP genotypes.
Proceedings of the ACM Conference on Bioinformatics, 2013

2012
A study of the neutrality of Boolean function landscapes in genetic programming.
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

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

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

2010
Pure Parsimony Xor Haplotyping.
IEEE ACM Trans. Comput. Biol. Bioinform., 2010

Beyond evolutionary trees.
Nat. Comput., 2010

Variants of constrained longest common subsequence.
Inf. Process. Lett., 2010

Haplotype Inference on Pedigrees with Recombinations and Mutations.
Proceedings of the Algorithms in Bioinformatics, 10th International Workshop, 2010

Parameterized Complexity of <i>k</i>-Anonymity: Hardness and Tractability.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

2009
Detecting Alternative Gene Structures from Spliced ESTs: A Computational Approach.
J. Comput. Biol., 2009

Parameterized Complexity of the k-anonymity Problem
CoRR, 2009

Minimum Factorization Agreement of Spliced ESTs.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

2007
A Comprehensive View of Fitness Landscapes with Neutrality and Fitness Clouds.
Proceedings of the Genetic Programming, 10th European Conference, 2007

2006
A quantitative study of neutrality in GP boolean landscapes.
Proceedings of the Genetic and Evolutionary Computation Conference, 2006


  Loading...