Blerina Sinaimeri
Blerina Sinaimeri
Associate Professor of Computer Science, Luiss University, Rome, Italy
Verified email at
Cited by
Cited by
EUCALYPT: efficient tree reconciliation enumerator
B Donati, C Baudet, B Sinaimeri, P Crescenzi, MF Sagot
Algorithms for Molecular Biology 10, 1-11, 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, 2015
Pairwise compatibility graphs: A survey
T Calamoneri, B Sinaimeri
siam REVIEW 58 (3), 445-460, 2016
All graphs with at most seven vertices are pairwise compatibility graphs
T Calamoneri, D Frascaria, B Sinaimeri
The Computer Journal 56 (7), 882-886, 2013
Exploring pairwise compatibility graphs
T Calamoneri, E Montefusco, R Petreschi, B Sinaimeri
Theoretical Computer Science 468, 23-36, 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-19, 2017
On relaxing the constraints in pairwise compatibility graphs
T Calamoneri, R Petreschi, B Sinaimeri
WALCOM: Algorithms and Computation: 6th International Workshop, WALCOM 2012 …, 2012
Pairwise compatibility graphs of caterpillars
T Calamoneri, A Frangioni, B Sinaimeri
The Computer Journal 57 (11), 1616-1623, 2014
On types of growth for graph-different permutations
J Körner, G Simonyi, B Sinaimeri
Journal of Combinatorial Theory, Series A 116 (3), 713-723, 2009
Geometric medians in reconciliation spaces of phylogenetic trees
KT Huber, V Moulton, MF Sagot, B Sinaimeri
Information Processing Letters 136, 96-101, 2018
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 Füredi, I Kantor, A Monti, B Sinaimeri
SIAM Journal on Discrete Mathematics 24 (3), 964-978, 2010
Exploring and visualizing spaces of tree reconciliations
KT Huber, V Moulton, MF Sagot, B Sinaimeri
Systematic biology 68 (4), 607-618, 2019
Capybara: equivalence ClAss enumeration of coPhylogenY event-BAsed ReconciliAtions
Y Wang, A Mary, MF Sagot, B Sinaimeri
Bioinformatics 36 (14), 4197-4199, 2020
L (2, 1)-labeling of oriented planar graphs
T Calamoneri, B Sinaimeri
Discrete Applied Mathematics 161 (12), 1719-1725, 2013
Compressed weighted de Bruijn graphs
GF Italiano, N Prezza, B Sinaimeri, R Venturini
CPM 2021-32nd Annual Symposium on Combinatorial Pattern Matching 191 (16), 1-16, 2021
On bubble generators in directed graphs
V Acuna, R Grossi, GF Italiano, L Lima, R Rizzi, G Sacomoto, MF Sagot, ...
Graph-Theoretic Concepts in Computer Science: 43rd International Workshop …, 2017
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
On cancellative set families
J Körner, B Sinaimeri
Combinatorics, Probability and Computing 16 (5), 767-773, 2007
Robustness of the parsimonious reconciliation method in cophylogeny
L Urbini, B Sinaimeri, C Matias, MF Sagot
Algorithms for Computational Biology: Third International Conference, AlCoB …, 2016
The system can't perform the operation now. Try again later.
Articles 1–20