2018 - Fellow of the International Society for Computational Biology
His primary scientific interests are in Algorithm, Phylogenetic tree, Data mining, Theoretical computer science and Computational biology. Bernard M. E. Moret has researched Algorithm in several fields, including Power, Combinatorics, Mathematical optimization, Fault and Median. His Phylogenetic tree study integrates concerns from other disciplines, such as Evolutionary biology, Phylogenetics and Tree.
His studies in Data mining integrate themes in fields like Tree and Gene. His biological study spans a wide range of topics, including Range and Genome evolution, Genome. Bernard M. E. Moret combines subjects such as Dynamical systems theory and System identification with his study of Theoretical computer science.
Bernard M. E. Moret mainly focuses on Genome, Phylogenetic tree, Phylogenetics, Algorithm and Genetics. His studies deal with areas such as Evolutionary biology, Gene rearrangement and Computational biology as well as Genome. His Phylogenetic tree research is multidisciplinary, relying on both Tree, Inference, Artificial intelligence and Data mining.
His Phylogenetics study incorporates themes from Bioinformatics and Genomics. Bernard M. E. Moret works mostly in the field of Algorithm, limiting it down to topics relating to Permutation and, in certain cases, Randomized algorithm, as a part of the same area of interest. His work in the fields of Cellular differentiation overlaps with other areas such as Epigenomics.
Bernard M. E. Moret mostly deals with Genome, Genetics, Computational biology, Theoretical computer science and Comparative genomics. His Segmental duplication study in the realm of Genome connects with subjects such as Optimal trajectory. His study on Phylogenetics and Cellular differentiation is often connected to Epigenomics as part of broader study in Genetics.
The study incorporates disciplines such as Synteny and Gene, Phylogenetic tree in addition to Computational biology. Bernard M. E. Moret usually deals with Phylogenetic tree and limits it to topics linked to Inference and Spite and Discrete mathematics. His studies in Theoretical computer science integrate themes in fields like Time complexity and Exact algorithm.
His scientific interests lie mostly in Edit distance, Genome, Exact algorithm, Segmental duplication and Algorithm. His biological study spans a wide range of topics, including Basis, Genome evolution, Theoretical computer science, Time complexity and Preprocessor. His Basis research incorporates themes from Integer programming and Orthologous Gene.
His study looks at the relationship between Segmental duplication and topics such as Linear programming, which overlap with Pairwise comparison. His Pairwise comparison study integrates concerns from other disciplines, such as Comparative genomics, Genomics, Leverage and Identification. Bernard M. E. Moret undertakes multidisciplinary studies into Algorithm and Integer in his work.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
A linear-time algorithm for computing inversion distance between signed permutations with an experimental study.
David A. Bader;Bernard M. E. Moret;Mi Yan.
Journal of Computational Biology (2001)
How many bootstrap replicates are necessary
Nicholas D Pattengale;Masoud Alipour;Olaf R P Bininda-Emonds;Bernard M E Moret.
Journal of Computational Biology (2010)
Decision Trees and Diagrams
Bernard M. E. Moret.
ACM Computing Surveys (1982)
Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy
B.M.E. Moret;L. Nakhleh;T. Warnow;C.R. Linder.
IEEE/ACM Transactions on Computational Biology and Bioinformatics (2004)
Algorithms from P to NP (vol. 1): design and efficiency
Bernard M. E. Moret;Henry D. Shapiro.
(1991)
A new implementation and detailed study of breakpoint analysis.
Bernard M. E. Moret;Stacia K. Wyman;David A. Bader;Tandy J. Warnow.
pacific symposium on biocomputing (2000)
New approaches for reconstructing phylogenies from gene order data
Bernard M. E. Moret;Li-San Wang;Tandy J. Warnow;Stacia K. Wyman.
intelligent systems in molecular biology (2001)
An empirical analysis of algorithms for constructing a minimum spanning tree
Bernard M. E. Moret;Henry D. Shapiro.
workshop on algorithms and data structures (1991)
Steps toward accurate reconstructions of phylogenies from gene-order data
Bernard M. E. Moret;Jijun Tang;Li-San Wang;Tandy Warnow.
Journal of Computer and System Sciences (2002)
Towards a discipline of experimental algorithmics
Bernard M. E. Moret.
Data structures, near neighbor searches, and methodology (2002)
If you think any of the details on this page are incorrect, let us know.
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:
University of Illinois at Urbana-Champaign
University of South Carolina
New Jersey Institute of Technology
École Polytechnique Fédérale de Lausanne
University of Pennsylvania
Pennsylvania State University
The University of Texas at Austin
Rice University
University of Virginia
University of Ottawa
Novatek
Royal Institute of Technology
Shaanxi Normal University
Paul Sabatier University
University of Zaragoza
University of Michigan–Ann Arbor
University of California, Irvine
Geological Survey of Canada
University of Louisville
University Medical Center Groningen
Witten/Herdecke University
University of Strathclyde
Garvan Institute of Medical Research
University College London
Peking University
National Institute for Astrophysics