Bernard M.E. Moret
Bernard M.E. Moret
Professor emeritus, Computer & Communication Sciences, EPFL; ISCB Fellow
Geverifieerd e-mailadres voor - Homepage
Geciteerd door
Geciteerd door
How many bootstrap replicates are necessary?
ND Pattengale, M Alipour, ORP Bininda-Emonds, BME Moret, ...
13th Int'l Conf. on Research in Computational Molecular Biology RECOMB'09 …, 2009
A linear-time algorithm for computing the inversion distance between signed permutations with an experimental study
DA Bader, BME Moret, M Yan
J. of Computational Biology 8 (5), 483-491, 2001
Decision trees and diagrams
BME Moret
ACM Computing Surveys (CSUR) 14 (4), 593-623, 1982
Phylogenetic networks: modeling, reconstructibility, and accuracy
BME Moret, L Nakhleh, T Warnow, CR Linder, A Tholse, A Padolina, ...
IEEE/ACM Trans. on Computational Biology and Bioinformatics 1 (1), 13-23, 2004
An empirical comparison of phylogenetic methods on chloroplast gene order data in Campanulaceae
ME Cosner, RK Jansen, BME Moret, LA Raubeson, LS Wang, T Warnow, ...
Comparative Genomics, 99-122, 2000
Algorithms from P to NP (vol. 1): Design and Efficiency
BME Moret, HD Shapiro
Benjamin-Cummings Publishing Co., 1991
A new implementation and detailed study of breakpoint analysis
BME Moret, S Wyman, DA Bader, T Warnow, M Yan
6th Pacific Symp. on Biocomputing PSB'01, 583-594, 2001
New approaches for reconstructing phylogenies from gene order data
BME Moret, LS Wang, T Warnow, SK Wyman
9th Conf. on Intelligent Systems in Molecular Biology ISMB'01, in …, 2001
Steps toward accurate reconstructions of phylogenies from gene-order data
BME Moret, J Tang, LS Wang, T Warnow
J. of Computer and System Sciences 65 (3), 508-525, 2002
Towards a discipline of experimental algorithmics
BME Moret
Data Structures, Near Neighbor Searches, and Methodology: Fifth and Sixth …, 2002
Rec-I-DCM3: a fast algorithmic technique for reconstructing phylogenetic trees
UW Roshan, T Warnow, BME Moret, TL Williams
3rd Computational Systems Bioinformatics Conf. CSB'04, 98-109, 2004
Inversion medians outperform breakpoint medians in phylogeny reconstruction from gene-order data
BME Moret, A Siepel, J Tang, T Liu
2nd Workshop on Algorithms in Bioinformatics WABI'02, 521-536, 2002
Map labeling and its generalizations
S Doddi, MV Marathe, A Mirzaian, BME Moret, B Zhu
8th ACM-SIAM Symp. on Discrete Algorithms SODA'97, 148-157, 1997
Genomic distances under deletions and insertions
M Marron, KM Swenson, BME Moret
Theoretical Computer Science 325 (3), 347-360, 2004
Scaling up accurate phylogenetic reconstruction from gene-order data
J Tang, BME Moret
11th Conf. on Intelligent Systems in Molecular Biology ISMB'03, in …, 2003
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree.
BME Moret, HD Shapiro
Computational Support for Discrete Mathematics 15, 99-117, 1992
Approximating the true evolutionary distance between two genomes
KM Swenson, M Marron, JV Earnest-DeYoung, BME Moret
ACM J. of Experimental Algorithmics 12, 3.5, 2008
On minimizing a set of tests
BME Moret, HD Shapiro
SIAM J. on Scientific and Statistical Computing 6, 983-1003, 1985
Finding an optimal inversion median: experimental results
A Siepel, BME Moret
1st Workshop on Algorithms in Bioinformatics WABI'01, 189-203, 2001
A new fast heuristic for computing the breakpoint phylogeny and experimental phylogenetic analyses of real and synthetic data
ME Cosner, RK Jansen, BME Moret, LA Raubeson, LS Wang, T Warnow, ...
8th Conf. on Intelligent Systems for Molecular Biology ISMB'00, 104-115, 2000
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20