Moret was born in 1953 in Vevey Switzerland, and did his undergraduate studies at the École Polytechnique Fédérale de Lausanne, graduating in 1975. He went on to graduate studies at the University of Tennessee, earning a Ph.D. in 1980. He then joined the faculty of the University of New Mexico, where he remained until 2006, when he moved to EPFL.
Moret is the author of The Theory of Computation (Addison-Wesley, 1998). With H. D. Shapiro, he is the co-author of Algorithms from P to NP, Volume I: Design and Efficiency (Benjamin Cummings, 1991).
He has also written many highly cited research papers in bioinformatics, including papers on calculating the minimum genetic rearrangement distance between a pair of related genomes and on evolutionary tree reconstruction.
- Curriculum vitae as of 2006, retrieved 2012-02-25.
- Bernard Moret appointed Full Professor, EPFL, 14 December 2005, retrieved 2012-02-25.
- Snodgrass, Richard T. (August 2011), "On experimental algorithmics", Ubiquity, doi:10.1145/2015996.2015997.
- Bader, David A.; Moret, Bernard M.E.; Yan, Mi (2001), "A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study", Journal of Computational Biology 8 (5): 483–491, doi:10.1089/106652701753216503.
- Moret, Bernard M. E.; Wyman, Stacia; Bader, David A.; Warnow, Tandy; Yan, Mi (2001), "A new implementation and detailed study of breakpoint analysis", Pac Symp Biocomput., pp. 583–594, PMID 11262975.
- Moret, B. M. E.; Nakhleh, L.; Warnow, T.; Linder, C. R.; Tholse, A.; Padolina, A.; Sun, J.; Timme, R. (2004), "Phylogenetic networks: modeling, reconstructibility, and accuracy", IEEE/ACM Transactions on Computational Biology and Bioinformatics 1 (1): 13–23, doi:10.1109/TCBB.2004.10.