Bernard Moret

Q: What Schools Are Affiliated With Bernard Moret

Bernard Moret is affiliated with the following schools: University of Tennessee, University of New Mexico

Bernard Moret's AcademicInfluence.com Rankings

Bernard Moret

Computer Science

#3715

World Rank

#3905

Historical Rank

#1359

USA Rank

Database

#7828

World Rank

#8142

Historical Rank

#992

USA Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Bernard Moret Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Bernard M. E. Moret is a Swiss-American computer scientist, an emeritus professor of Computer Science at the École Polytechnique Fédérale de Lausanne in Switzerland. He is known for his work in computational phylogenetics, and in particular for mathematics and methods for computing phylogenetic trees using genome rearrangement events.

(See a Problem?)

Bernard Moret's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

How Many Bootstrap Replicates Are Necessary? (2009) (1049)
Phylogenetic Inference (2011) (569)
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study (2001) (384)
Decision Trees and Diagrams (1982) (352)
Phylogenetic networks: modeling, reconstructibility, and accuracy (2004) (186)
A New Implmentation and Detailed Study of Breakpoint Analysis (2000) (147)
New approaches for reconstructing phylogenies from gene order data (2001) (146)
Steps toward accurate reconstructions of phylogenies from gene-order data (2002) (125)
An Empirical Comparison of Phylogenetic Methods on Chloroplast Gene Order Data in Campanulaceae (2000) (106)
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data (2002) (99)
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree (1992) (98)
Towards a discipline of experimental algorithmics (1999) (97)
Genomic Distances under Deletions and Insertions (2003) (91)
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees (2004) (87)
Scaling up accurate phylogenetic reconstruction from gene-order data (2003) (86)
Evaluating synteny for improved comparative studies (2014) (84)
Rec-I-DCM3: a fast algorithmic technique for reconstructing phylogenetic trees (2004) (83)
On Minimizing a Set of Tests (1985) (82)
Map labeling and its generalizations (1997) (81)
Finding an Optimal Inversion Median: Experimental Results (2001) (80)
A Metric for Phylogenetic Trees Based on Matching (2011) (80)
Efficiently Computing the Robinson-Foulds Metric (2007) (78)
Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods (2002) (74)
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining (2001) (74)
Reconstructing phylogenies from gene-content and gene-order data (2007) (72)
Algorithms from P to NP (1991) (72)
Approximating the true evolutionary distance between two genomes (2008) (69)
An Exact Characterization of Greedy Structures (1993) (66)
Refining transcriptional regulatory networks using network evolutionary models and gene histories (2010) (65)
High-Performance Algorithm Engineering for Computational Phylogenetics (2001) (64)
An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes (2015) (60)
Industrial applications of high-performance computing for phylogeny reconstruction (2001) (60)
A New Fast Heuristic for Computing the Breakpoint Phylogeny and Experimental Phylogenetic Analyses of Real and Synthetic Data (2000) (59)
Absolute convergence: true trees from short sequences (2001) (57)
Sequence-Length Requirements for Phylogenetic Methods (2002) (56)
Estimating true evolutionary distances under the DCJ model (2008) (54)
Maximum Likelihood Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Tree of 68 Eukaryotes (2012) (53)
Performance of Supertree Methods on Various Data Set Decompositions (2004) (52)
A fast linear-time algorithm for inversion distance with an experimental comparison (2001) (51)
Algorithms from P to NP (vol. 1): design and efficiency (1991) (50)
An investigation of phylogenetic likelihood methods (2003) (46)
GASTS: Parsimony Scoring under Rearrangements (2011) (46)
Comparing genomes with rearrangements and segmental duplications (2015) (43)
Fast Phylogenetic Methods for the Analysis of Genome Rearrangement Data: An Empirical Study (2001) (42)
Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content (2003) (42)
The Accuracy of Fast Phylogenetic Methods for Large Datasets (2001) (42)
Advances in phylogeny reconstruction from gene order and content data. (2005) (39)
Planar NAE3SAT is in P (1988) (39)
Phylogenetic reconstruction from arbitrary gene-order data (2004) (39)
Approximating the true evolutionary distance between genomes (2005) (38)
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance (2015) (37)
Uncovering Hidden Phylogenetic Consensus in Large Data Sets (2011) (36)
Algorithms and Experiments: The New (and Old) Methodology (2001) (35)
ChIPnorm: A Statistical Method for Normalizing and Identifying Differential Regions in Histone Modification ChIP-seq Libraries (2012) (35)
Gene rearrangement analysis and ancestral order inference from chloroplast genomes with inverted repeat (2008) (35)
On Computing Breakpoint Distances for Genomes with Duplicate Genes (2016) (35)
Network (Reticulated) Evolution: Biology, Models, and Algorithms (2004) (32)
Fast and Accurate Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Novel Robustness Estimator (2010) (30)
The Activity of a Variable and Its Relation to Decision Trees (1980) (30)
Reversing Gene Erosion - Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data (2004) (30)
NetGen: generating phylogenetic networks with diploid hybrids (2006) (28)
An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes (2014) (28)
Heuristics for the inversion median problem (2010) (28)
A detailed study of breakpoint analysis (2001) (27)
Algorithm Engineering for Parallel Computation (2000) (26)
Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics (2000) (26)
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture (2001) (25)
How to present a paper on experimental work with algorithms (1999) (25)
Uncovering Hidden Phylogenetic Consensus (2010) (24)
Theory of computation (1997) (22)
Bootstrapping phylogenies inferred from rearrangement data (2011) (22)
Sorting Signed Permutations by Inversions in O(nlogn) Time (2009) (22)
An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree (1991) (21)
Estimating true evolutionary distances under rearrangements, duplications, and losses (2010) (21)
Fast Phylogenetic Methods For Genome Rearrangement Evolution: An Empirical Study (2002) (21)
Boolean Difference Techniques for Time-Sequence and Common-Cause Analysis of Fault-Trees (1984) (21)
Three-coloring the vertices of a triangulated simple polygon (1992) (20)
New approaches for reconstructing phylogenies based on gene order (2001) (19)
Hurdles Hardly Have to Be Heeded (2008) (19)
Point set labeling with specified positions (1999) (17)
A new fast heuristic for computing the breakpoint phylogeny and a phylogenetic analysis of a group of highly rearranged chloroplast genomes (2000) (17)
FluReF, an automated flu virus reassortment finder based on phylogenetic trees (2010) (17)
Sorting signed permutations by inversions in O(nlogn) time. (2010) (16)
Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements (2005) (16)
Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids (1998) (16)
Inversion-based genomic signatures (2009) (16)
Sorting genomes with rearrangements and segmental duplications through trajectory graphs (2013) (16)
A Framework for Orthology Assignment from Gene Rearrangement Data (2005) (16)
A New Genomic Evolutionary Model for Rearrangements, Duplications, and Losses That Applies across Eukaryotes and Prokaryotes (2010) (16)
Inferring transcript phylogenies (2011) (16)
Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach (2008) (15)
Probabilistic partitioning methods to find significant patterns in ChIP-Seq data (2014) (15)
Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? (2013) (14)
ACM's Journal of Experimental Algorithmics: Bridging the Gap Between Theory and Practice (1997) (14)
GRAPPA runs in record time (2000) (14)
Network routing models applied to aircraft routing problems (1995) (14)
Toward new software for computational phylogenetics (2002) (14)
Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes (2007) (13)
TIBA: a tool for phylogeny inference from rearrangement data with bootstrap analysis (2012) (13)
Study of cell differentiation by phylogenetic analysis using histone modification data (2014) (12)
The computational metaphor and quantum physics (1983) (11)
Refining Regulatory Networks through Phylogenetic Transfer of Information (2012) (11)
Maximum independent sets of commuting and noninterfering inversions (2009) (9)
An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations (2007) (9)
How to Find a Minimum Spanning Tree in Practice (1991) (9)
An exact linear-time algorithm for computing genomic distances under inversions and deletions U (2003) (9)
Constructive complexity (1991) (9)
A Transcript Perspective on Evolution (2012) (7)
Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000] (2002) (7)
Combinatorial algorithms test sets CATS: the ACM/EATCS platform for experimental research (1999) (7)
Phylogenetic networks: simulation, characterization, and reconstruction (2007) (7)
Quartet-Based Phylogeny Reconstruction from Gene Orders (2005) (7)
A Measure Of Scene Content (1979) (7)
New Software for Computational Phylogenetics (2002) (7)
Absolute phylogeny: true trees from short sequences (2001) (7)
A maximum-likelihood approach for building cell-type trees by lifting (2016) (6)
Large-scale phylogenetic reconstruction (2007) (6)
High-performance algorithm engineering for parallel computation (2002) (6)
High‐Performance Phylogeny Reconstruction Under Maximum Parsimony (2006) (6)
Quartet methods for phylogeny reconstruction from gene orders (2005) (6)
Symmetric and Threshold Boolean Functions Are Exhaustive (1983) (6)
Joint Routing in Networks (1993) (6)
Improving Inference of Transcriptional Regulatory Networks Based on Network Evolutionary Models (2009) (5)
Proceedings of the First International Workshop on Algorithms in Bioinformatics (2001) (5)
The Ice Rink Problem (1997) (5)
Large-scale phylogenetic reconstruction from arbitrary gene-order data (2004) (5)
Folding a Triangulated Simple Polygon: Structural and Algorithmic Results (1991) (5)
Computational Challenges from the Tree of Life (2005) (5)
The representation of discrete functions by decision trees: aspects of complexity and problems of testing (1982) (4)
Efficiently Computing the (2006) (4)
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric (2006) (4)
Phylogenetic Analysis of Cell Types Using Histone Modifications (2013) (4)
ProPhyC: A Probabilistic Phylogenetic Model for Refining Regulatory Networks (2011) (4)
High-Performance Algorithm Engineering for Gene-Order Phylogenies (4)
Ice rinks and cruise missiles: sweeping a simple polygon (1997) (3)
Greedy Strict-Consensus Merger : A New Method to Combine Multiple Phylogenetic Trees (2010) (3)
A method for the choice of smoothing parameter (1990) (3)
Using Phylogenetic Relationships to Improve the Inference of Transcriptional Regulatory Networks (2008) (3)
Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results (2009) (3)
NEMo: An Evolutionary Model With Modularity for PPI Networks (2016) (3)
Algorithms in Bioinformatics, 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings (2006) (3)
Inferring ancestral chloroplast genomes with inverted repeat (2006) (2)
A new method for one-dimensional linear feature transformations (1990) (2)
Sequence-Based Synteny Analysis of Multiple Large Genomes. (2018) (2)
Bioinformatics and Phylogenetics (2019) (2)
Phylogenetic Transfer of Knowledge for Biological Networks (2014) (2)
The design of a nonparametric hierarchical classifier (1990) (2)
Inferring Ancestral Chloroplast Genomes with Inverted Repea (2006) (2)
Phylogenetic Analysis of Whole Genomes - (Keynote Talk) (2011) (2)
Bootstrapping phylogenies inferred from rearrangement data (2012) (1)
Algorithms in bioinformatics : First International Workshop, WABI 2001, Århus, Denmark, August 28-31, 2001 : proceedings (2001) (1)
Reversing gene erosion: Reconstructing ancestral bacterial genomes from gene order and content data (2004) (1)
The Ice Rink Problem 1 (1997) (1)
Efficient algorithms for phylogenetic post-analysis (2010) (1)
Consensus methods using phylogenetic databases (2005) (1)
Sorting genomes with rearrangements and segmental duplications through trajectory graphs (2013) (1)
Study of cell differentiation by phylogenetic analysis using histone modification data (2014) (1)
On the DCJ Median Problem (2014) (1)
Computational Challenges In Comparative Genomics: Gene Family Evolution, Ancestral Genome Reconstruction, And Applications To Human Genetics (2008) (1)
1 High-Performance Phylogeny Reconstruction Under Maximum Parsimony (2004) (0)
Algorithms in Bioinformatics (vol. # 4175) : 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings (2006) (0)
Alenex workshop preface (2005) (0)
Phylogenetic postprocessing (2005) (0)
FOR LARGE PAIRWISE GENOMIC DISTANCES (0)
Proceedings of the 6th international conference on Algorithms in Bioinformatics (2006) (0)
Evaluating EST Clustering with Simulated Data (0)
Inferring Ancestral Genomes with Duplications (2005) (0)
Identifying orthologs: cycle splitting on the breakpoint graph (2005) (0)
Modularity in PPI Networks : Characteristics of Existing Networks and Models of Evolution (0)
Differentiation trees for cell developmental history based on histone modifications (2013) (0)
Quick Overview of Multiple Sequence Alignment (0)
COMPUTATIONAL CHALLENGES IN COMPARATIVE GENOMICS – Session Introduction (2009) (0)
Extending the Reach of Phylogenetic Inference (2013) (0)
Algorithms in Bioinformatics (2001) (0)
Fast computation of approximate weak common intervals in multiple indeterminate strings (2023) (0)
DISTANCE CORRECTION FOR LARGE PAIRWISE GENOMIC DISTANCES (2004) (0)
Session introduction (2003) (0)
Mathematics of Evolution and Phylogeny Library of Congress Cataloging in Publication Data (data Available) (2004) (0)
Beyond gap models: Reconstructing alignments and phylogenies under genomic-scale events (2007) (0)
Phylogenies from Gene Order Data: A Detailed Study of Breakpoint Analysis (2007) (0)
Topics in Bioinformatics I ( Computational Models and Problems for ) Genome Evolution Overview and Annotated Bibliography (2007) (0)
Folding a simple polygon: a paradigm for computational geometry (1995) (0)
A Recursive Procedure for Updating Quadratic Forms and Its Application to Feature Selection. (1978) (0)
Complexity, Testability, and Fault Analysis of Digital, Analog, and Hybrid Systems. (1984) (0)
Dynamical system representation of open address hash functions (1999) (0)
Efficient approximation algorithms for geometric packing and covering problems (2000) (0)
The Designofa Nonparametric Hierarchical Classi erChea (2007) (0)
Workshop on algorithm engineering: a report (1997) (0)
for An empirical analysis of algorithms (2005) (0)
Two studies in combinatorial optimization: contact-map overlap and minimum-bends tsp (2005) (0)
Journal of Experimental Algorithmics (JEA) Volume 4 (1999) (0)
Experimental Algorithmics (Dagstuhl Seminar 00371) (2021) (0)

This paper list is powered by the following services:

Other Resources About Bernard Moret

en.wikipedia.org

What Schools Are Affiliated With Bernard Moret?

Bernard Moret is affiliated with the following schools: