World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
9058
World Ranking
5658
National Ranking
117

Research.com Recognitions

  • 2018 - Fellow of the International Society for Computational Biology

Overview

Bernard M. E. Moret is affiliated with the École Polytechnique Fédérale de Lausanne in Switzerland. Their research spans multiple domains within computer science and molecular biology, focusing on the intersection of computational methods and biological data analysis.

Their recent publication includes the paper titled Fast computation of approximate weak common intervals in multiple indeterminate strings, published in 2023 in the arXiv (Cornell University) repository.

Moret frequently collaborates with other researchers, notably with Daniel Doerr.

  • arXiv (Cornell University)

The main fields of study for Moret consist of:

  • Computer Science
  • Biochemistry, Genetics and Molecular Biology

Their work includes subfields such as:

  • Artificial Intelligence
  • Molecular Biology

Key research topics covered by Moret's publications include:

  • Natural Language Processing Techniques
  • Algorithms and Data Compression
  • Genomics and Phylogenetic Studies

In recognition of their contributions, Moret was awarded the title of Fellow of the International Society for Computational Biology in 2018.

Best Publications

  • How many bootstrap replicates are necessary

    Nicholas D Pattengale;Masoud Alipour;Olaf R P Bininda-Emonds;Bernard M E Moret

  • A linear-time algorithm for computing inversion distance between signed permutations with an experimental study.

    David A. Bader;Bernard M. E. Moret;Mi Yan

  • Decision Trees and Diagrams

    Bernard M. E. Moret

  • How Many Bootstrap Replicates Are Necessary

    Nicholas D. Pattengale;Masoud Alipour;Olaf R. Bininda-Emonds;Bernard M. Moret

  • Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy

    B.M.E. Moret;L. Nakhleh;T. Warnow;C.R. Linder

  • Algorithms from P to NP (vol. 1): design and efficiency

    Bernard M. E. Moret;Henry D. Shapiro

  • A new implementation and detailed study of breakpoint analysis.

    Bernard M. E. Moret;Stacia K. Wyman;David A. Bader;Tandy J. Warnow

  • New approaches for reconstructing phylogenies from gene order data

    Bernard M. E. Moret;Li-San Wang;Tandy J. Warnow;Stacia K. Wyman

  • An empirical analysis of algorithms for constructing a minimum spanning tree

    Bernard M. E. Moret;Henry D. Shapiro

  • Steps toward accurate reconstructions of phylogenies from gene-order data

    Bernard M. E. Moret;Jijun Tang;Li-San Wang;Tandy Warnow

  • Rec-I-DCM3: a fast algorithmic technique for reconstructing phylogenetic trees

    U.W. Roshan;T. Warnow;B.M.E. Moret;T.L. Williams

  • Towards a discipline of experimental algorithmics

    Bernard M. E. Moret

  • The theory of computation

    Bernard M. Moret

  • Map labeling and its generalizations

    Srinivas Doddi;Madhav V. Marathe;Andy Mirzaian;Bernard M. E. Moret

  • An Empirical Comparison of Phylogenetic Methods on Chloroplast Gene Order Data in Campanulaceae

    Mary E. Cosner;Robert K. Jansen;Bernard M. E. Moret;Linda A. Raubeson

  • Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data

    Bernard M. E. Moret;Adam C. Siepel;Jijun Tang;Tao Liu

  • Scaling up accurate phylogenetic reconstruction from gene-order data

    Jijun Tang;Bernard M. E. Moret

  • An empirical assessment of algorithms for constructing a minimum spanning tree

    Bernard M. E. Moret;Henry D. Shapiro

  • A Metric for Phylogenetic Trees Based on Matching

    Yu Lin;Vaibhav Rajan;Bernard M. E. Moret

  • Evaluating synteny for improved comparative studies

    Cristina G. Ghiurcuta;Bernard M. E. Moret

  • On Minimizing a Set of Tests

    Bernard M. E. Moret;Henry D. Shapiro

  • Approximating the true evolutionary distance between two genomes

    Krister M. Swenson;Mark Marron;Joel V. Earnest-Deyoung;Bernard M. E. Moret

Frequent Co-Authors

Tandy Warnow
Tandy Warnow University of Illinois at Urbana-Champaign
Jijun Tang
Jijun Tang University of South Carolina
David A. Bader
David A. Bader New Jersey Institute of Technology
Philipp Bucher
Philipp Bucher École Polytechnique Fédérale de Lausanne
Li-San Wang
Li-San Wang University of Pennsylvania
Claude W. dePamphilis
Claude W. dePamphilis Pennsylvania State University
Robert K. Jansen
Robert K. Jansen The University of Texas at Austin
David Sankoff
David Sankoff University of Ottawa
Madhav V. Marathe
Madhav V. Marathe University of Virginia
Luay Nakhleh
Luay Nakhleh Rice University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA often leads to broader opportunities in technology and engineering. If you are seeking flexibility, pursuing an online mechanical engineering degree is a great option with strong demand in industry and manufacturing.

For those interested in more theoretical domains, the cheapest online physics degree programs offer affordable routes to versatile scientific careers or further studies.

Data Science is another rapidly growing field closely related to computer science. You can become a data expert with a data scientist degree—a wise choice for those interested in analytics, AI, and big data.

For students who want to blend computing with circuit design, reviewing online electrical engineering career outcomes will help you understand job prospects in power systems, telecommunications, and emerging tech fields.

These related degrees not only share foundational skills with computer science but also open diverse and rewarding career pathways across industries.

Best Scientists Citing Bernard M. E. Moret

Trending Scientists

Recently Published Articles