Bernard M.E. Moret
机构: ISCB Fellow, Professor emeritus, Computer & Communication Sciences, EPFL
主页: epfl.ch
每年引用次数
引用次数
引用: 8,380
H-指数: 48
I10-指数 : 111
出版物: 167
Improving inference of transcriptional regulatory networks based on network evolutionary models
Xiuwei Zhang , Bernard ME Moret
9th Workshop on Algorithms in Bioinformatics WABI 2009 in LNCS 5724 412 -425
6
2009
Representation of Discrete Functions by Decision Trees: Aspects of Complexity and Problems of Testing
Bernard ME Moret
Dissertation Abstracts International Part B: Science and Engineering[DISS. ABST. INT. PT. B- SCI. & ENG.], 41 ( 8) 1981 -1981
4
1981
Sequence-based synteny analysis of multiple large genomes
Daniel Doerr , Bernard ME Moret
Comparative Genomics: Methods and Protocols 317 -329
3
2018
6th Workshop on Algorithms in bioinformatics
Philipp Bucher , Bernard ME Moret
WABI 2006 (2006: Zurich, Switzerland)
3
2006
Higher Fidelity Subtree Merging for Disk-Covering Methods
Nicholas D Pattengale , Krister M Swenson , Monique M Morin , Bernard ME Moret
Poster, Algorithmic Biology, http://www. calit2. net/events/algorithmicbio/files/PattengaleAlgoBio2006. pdf
3
2006
Reversing Gene Erosion--Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data
Joel V Earnest-De Young , Emmanuelle Lerat , Bernard ME Moret
Lecture Notes in Computer Science 3240 1 -13
3
2004
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree.
Bernard ME Moret , Henry D Shapiro
Computational Support for Discrete Mathematics 15 99 -117
3
1992
Optimization criteria for decision trees
Bernard ME Moret , Michael G Thomason , Rafael C Gonzalez
University of New Mexico
3
1981
A new genomic evolutionary model for rearrangements, duplications, and losses that applies across eukaryotes and prokaryotes
Yu Lin , Bernard ME Moret
8th RECOMB Workshop on Comparative Genomics RECOMB-CG'10, in LNCS 6398 228 -239
1
2010
Persistent linked structures at constant worst-case cost
Ali R Boroujerdi , Bernard ME Moret
8th International Conference on Computing and Information ICCI'96 68 -78
1
1996
Using symmetry and rigidity: a simpler approach to NP-completeness proofs
Bernard ME Moret , Henry D Shapiro
Department of Computer Science, College of Engineering, University of New Mexico
1
1985
Fast computation of approximate weak common intervals in multiple indeterminate strings
Daniel Doerr , Bernard ME Moret
arXiv preprint arXiv:2304.02657
2023
Computational Challenges in Comparative Genomics – Session Introduction
Bernard ME Moret , Webb C Miller , Pavel A Pevzner , David Sankoff
15th Pacific Symp. on Biocomputing PSB'10 15 1 -1
2010
A Comparison of Algorithms and Data Structures for the Box Containment Problem
Jingkun Yu , Bernard ME Moret
University of New Mexico
2002
Message Dispatch in Dynamically-Typed Object-Oriented Languages
Martin Muller , Bernard ME Moret
1995
Folding a simple polygon: a paradigm for computational geometry
Ali A Kooshesh , Bernard ME Moret
23rd ACM Conference on Computer science 114 -118
1995
Design & efficiency
Bernard ME Moret , Henry D Shapiro
(No Title)
1991
Algorithms from P to NP (vol. 1): design and efficiency
Henry D. Shapiro , Bernard M. E. Moret
Benjamin-Cummings Publishing Co., Inc.
35
1991
Towards a discipline of experimental algorithmics
Bernard M. E. Moret
Data structures, near neighbor searches, and methodology 197 -213
60
2002
Computational challenges from the Tree of Life
Bernard M. E. Moret
Proc. 6th Workshop on Algorithm Engineering and Experiments (ALENEX'05) 3 -16
6
2005
Tandy Warnow David A. Bader Yu Lin Jijun Tang Nicholas D. Pattengale Krister M. Swenson Li-San Wang Stacia K. Wyman Luay Nakhleh Tiffani L. Williams Vaibhav Rajan C. Randal Linder Alexandros Stamatakis Usman Roshan Robert Jansen Olaf R.P. Bininda-Emonds Masoud Aipour Mingfu Shao Xiuwei Zhang Katherine St. John