Blerina Sinaimeri
Blerina Sinaimeri
Researcher INRIA (Lyon, France)
Email verificata su
TitoloCitata daAnno
EUCALYPT: efficient tree reconciliation enumerator
B Donati, C Baudet, B Sinaimeri, P Crescenzi, MF Sagot
Algorithms for Molecular Biology 10 (1), 3, 2015
Cophylogeny reconstruction via an approximate Bayesian computation
C Baudet, B Donati, B Sinaimeri, P Crescenzi, C Gautier, C Matias, ...
Systematic biology 64 (3), 416-431, 2014
All graphs with at most seven vertices are pairwise compatibility graphs
T Calamoneri, D Frascaria, B Sinaimeri
The Computer Journal 56 (7), 882-886, 2012
Pairwise compatibility graphs: A survey
T Calamoneri, B Sinaimeri
SIAM Review 58 (3), 445-460, 2016
Exploring pairwise compatibility graphs
T Calamoneri, E Montefusco, R Petreschi, B Sinaimeri
Theoretical Computer Science 468, 23-36, 2013
On relaxing the constraints in pairwise compatibility graphs
T Calamoneri, R Petreschi, B Sinaimeri
International Workshop on Algorithms and Computation, 124-135, 2012
On types of growth for graph-different permutations
J Krner, G Simonyi, B Sinaimeri
Journal of Combinatorial Theory, Series A 116 (3), 713-723, 2009
On the pairwise compatibility property of some superclasses of threshold graphs
T Calamoneri, R Petreschi, B Sinaimeri
Discrete Mathematics, Algorithms and Applications 5 (02), 1360002, 2013
On reverse-free codes and permutations
Z Fredi, I Kantor, A Monti, B Sinaimeri
SIAM Journal on Discrete Mathematics 24 (3), 964-978, 2010
Navigating in a sea of repeats in rna-seq without drowning
G Sacomoto, B Sinaimeri, C Marchet, V Miele, MF Sagot, V Lacroix
International Workshop on Algorithms in Bioinformatics, 82-96, 2014
Pairwise compatibility graphs of caterpillars
T Calamoneri, A Frangioni, B Sinaimeri
The Computer Journal 57 (11), 1616-1623, 2014
L (2, 1)-labeling of oriented planar graphs
T Calamoneri, B Sinaimeri
Discrete Applied Mathematics 161 (12), 1719-1725, 2013
Playing hide and seek with repeats in local and global de novo transcriptome assembly of short RNA-seq reads
L Lima, B Sinaimeri, G Sacomoto, H Lopez-Maestre, C Marchet, V Miele, ...
Algorithms for molecular biology 12 (1), 2, 2017
On bubble generators in directed graphs
V Acuna, R Grossi, GF Italiano, L Lima, R Rizzi, G Sacomoto, MF Sagot, ...
International Workshop on Graph-Theoretic Concepts in Computer Science, 18-31, 2017
Robustness of the parsimonious reconciliation method in cophylogeny
L Urbini, B Sinaimeri, C Matias, MF Sagot
International Conference on Algorithms for Computational Biology, 119-130, 2016
On cancellative set families
J Krner, B Sinaimeri
Combinatorics, Probability and Computing 16 (5), 767-773, 2007
Geometric medians in reconciliation spaces of phylogenetic trees
KT Huber, V Moulton, MF Sagot, B Sinaimeri
Information Processing Letters 136, 96-101, 2018
On pairwise compatibility of some graph (super) classes
T Calamoneri, B Sinaimeri, M Gastaldello
arXiv preprint arXiv:1504.06454, 2015
Rainbow graph splitting
A Monti, B Sinaimeri
Theoretical Computer Science 412 (39), 5315-5324, 2011
Structures of diversity
B Sinaimeri
PhD thesis, Sapienza University, Rome, 2009
Il sistema al momento non pu eseguire l'operazione. Riprova pi tardi.
Articoli 1–20