Bernard M. E. Moret

Orcid: 0000-0003-1549-4544

Affiliations:
  • EPFL, Lausanne, Switzerland
  • University of New Mexico, Albuquerque, NM, USA (1980 - 2006)
  • University of Tennessee, Knoxville, TN, USA (PhD 1980)


According to our database1, Bernard M. E. Moret authored at least 116 papers between 1980 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Fast computation of approximate weak common intervals in multiple indeterminate strings.
CoRR, 2023

2017
On Computing Breakpoint Distances for Genomes with Duplicate Genes.
J. Comput. Biol., 2017

New Genome Similarity Measures based on Conserved Gene Adjacencies.
J. Comput. Biol., 2017

2016
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance.
J. Comput. Biol., 2016

A maximum-likelihood approach for building cell-type trees by lifting.
BMC Genom., 2016

NEMo: An Evolutionary Model with Modularity for PPI Networks.
Proceedings of the Bioinformatics Research and Applications - 12th International Symposium, 2016

2015
An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes.
J. Comput. Biol., 2015

Comparing genomes with rearrangements and segmental duplications.
Bioinform., 2015

2014
Study of cell differentiation by phylogenetic analysis using histone modification data.
BMC Bioinform., 2014

Probabilistic partitioning methods to find significant patterns in ChIP-Seq data.
Bioinform., 2014

Evaluating synteny for improved comparative studies.
Bioinform., 2014

An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes.
Proceedings of the Research in Computational Molecular Biology, 2014

On the DCJ Median Problem.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
A Transcript Perspective on Evolution.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Sorting genomes with rearrangements and segmental duplications through trajectory graphs.
BMC Bioinform., 2013

Phylogenetic Analysis of Cell Types Using Histone Modifications.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Extending the Reach of Phylogenetic Inference.
Proceedings of the Algorithms in Bioinformatics - 13th International Workshop, 2013

Maximum Likelihood Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Tree of 68 Eukaryotes.
Proceedings of the Biocomputing 2013: Proceedings of the Pacific Symposium, 2013

Rearrangements in Phylogenetic Inference: Compare, Model, or Encode?
Proceedings of the Models and Algorithms for Genome Evolution, 2013

2012
Refining Regulatory Networks through Phylogenetic Transfer of Information.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

A Metric for Phylogenetic Trees Based on Matching.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Inferring transcript phylogenies.
BMC Bioinform., 2012

TIBA: a tool for phylogeny inference from rearrangement data with bootstrap analysis.
Bioinform., 2012

Bootstrapping phylogenies inferred from rearrangement data.
Algorithms Mol. Biol., 2012

2011
Uncovering Hidden Phylogenetic Consensus in Large Data Sets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Fast and Accurate Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Novel Robustness Estimator.
J. Comput. Biol., 2011

A New Genomic Evolutionary Model for Rearrangements, Duplications, and Losses that Applies across Eukaryotes and Prokaryotes.
J. Comput. Biol., 2011

GASTS: Parsimony Scoring under Rearrangements.
Proceedings of the Algorithms in Bioinformatics - 11th International Workshop, 2011

ProPhyC: A Probabilistic Phylogenetic Model for Refining Regulatory Networks.
Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

Phylogenetic Analysis of Whole Genomes - (Keynote Talk).
Proceedings of the Bioinformatics Research and Applications - 7th International Symposium, 2011

2010
Sorting Signed Permutations by Inversions in <i>O</i>(<i>n</i>log<i>n</i>) Time.
J. Comput. Biol., 2010

How Many Bootstrap Replicates Are Necessary?
J. Comput. Biol., 2010

Heuristics for the inversion median problem.
BMC Bioinform., 2010

Estimating true evolutionary distances under rearrangements, duplications, and losses.
BMC Bioinform., 2010

Refining transcriptional regulatory networks using network evolutionary models and gene histories.
Algorithms Mol. Biol., 2010

Uncovering Hidden Phylogenetic Consensus.
Proceedings of the Bioinformatics Research and Applications, 6th International Symposium, 2010

FluRF, an automated flu virus reassortment finder based on phylogenetic trees.
Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine, 2010

2009
Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results.
J. Comput. Biol., 2009

Maximum independent sets of commuting and noninterfering inversions.
BMC Bioinform., 2009

Inversion-based genomic signatures.
BMC Bioinform., 2009

Improving Inference of Transcriptional Regulatory Networks Based on Network Evolutionary Models.
Proceedings of the Algorithms in Bioinformatics, 9th International Workshop, 2009

Sorting Signed Permutations by Inversions in O(nlogn) Time.
Proceedings of the Research in Computational Molecular Biology, 2009

Session Introduction.
Proceedings of the Biocomputing 2009: Proceedings of the Pacific Symposium, 2009

2008
Approximating the true evolutionary distance between two genomes.
ACM J. Exp. Algorithmics, 2008

Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach.
Proceedings of the Algorithms in Bioinformatics, 8th International Workshop, 2008

Hurdles Hardly Have to Be Heeded.
Proceedings of the Comparative Genomics, International Workshop, 2008

Session Introduction.
Proceedings of the Biocomputing 2008, 2008

Estimating true evolutionary distances under the DCJ model.
Proceedings of the Proceedings 16th International Conference on Intelligent Systems for Molecular Biology (ISMB), 2008

Using Phylogenetic Relationships to Improve the Inference of Transcriptional Regulatory Networks.
Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics, 2008

Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes.
Proceedings of the 6th Asia-Pacific Bioinformatics Conference, 2008

2007
Efficiently Computing the Robinson-Foulds Metric.
J. Comput. Biol., 2007

An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations.
Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, 2007

Reconstructing phylogenies from gene-content and gene-order data.
Proceedings of the Mathematics of Evolution and Phylogeny., 2007

2006
NetGen: generating phylogenetic networks with diploid hybrids.
Bioinform., 2006

A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric.
Proceedings of the Research in Computational Molecular Biology, 2006

Inferring Ancestral Chloroplast Genomes with Inverted Repea.
Proceedings of the 2006 International Conference on Bioinformatics & Computational Biology, 2006

2005
A Framework for Orthology Assignment from Gene Rearrangement Data.
Proceedings of the Comparative Genomics, 2005

Phylogenetic Postprocessing.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005

Consensus Methods Using Phylogenetic Databases.
Proceedings of the Fourth International IEEE Computer Society Computational Systems Bioinformatics Conference Workshops & Poster Abstracts, 2005

Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements.
Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

Quartet-Based Phylogeny Reconstruction from Gene Orders.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Computational Challenges from the Tree of Life.
Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004
Genomic Distances under Deletions and Insertions.
Theor. Comput. Sci., 2004

Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy.
IEEE ACM Trans. Comput. Biol. Bioinform., 2004

Reversing Gene Erosion - Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data.
Proceedings of the Algorithms in Bioinformatics, 4th International Workshop, 2004

Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees.
Proceedings of the 3rd International IEEE Computer Society Computational Systems Bioinformatics Conference, 2004

Phylogenetic Reconstruction from Arbitrary Gene-Order Data.
Proceedings of the 4th IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2004), 2004

2003
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining.
J. Algorithms, 2003

Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods.
Proceedings of the 8th Pacific Symposium on Biocomputing, 2003

Scaling up accurate phylogenetic reconstruction from gene-order data.
Proceedings of the Eleventh International Conference on Intelligent Systems for Molecular Biology, June 29, 2003

An Investigation of Phylogenetic Likelihood Methods.
Proceedings of the 3rd IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2003), 2003

2002
High-Performance Algorithm Engineering for Computational Phylogenetics.
J. Supercomput., 2002

Steps toward accurate reconstructions of phylogenies from gene-order data.
J. Comput. Syst. Sci., 2002

Point Set Labeling with Specified Positions.
Int. J. Comput. Geom. Appl., 2002

Toward New Software for Computational Phylogenetics.
Computer, 2002

Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Sequence-Length Requirements for Phylogenetic Methods.
Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Fast Phylogenetic Methods for the Analysis of Genome Rearrangement Data: An Empirical Study.
Proceedings of the 7th Pacific Symposium on Biocomputing, 2002

The Accuracy of Fast Phylogenetic Methods for Large Datasets.
Proceedings of the 7th Pacific Symposium on Biocomputing, 2002

2001
Algorithms and Experiments: The New (and Old) Methodology.
J. Univers. Comput. Sci., 2001

A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.
J. Comput. Biol., 2001

Foreword.
J. Algorithms, 2001

Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture.
Proceedings of the Algorithm Engineering, 2001

Finding an Optimal Inversion Median: Experimental Results.
Proceedings of the Algorithms in Bioinformatics, First International Workshop, 2001

Absolute convergence: true trees from short sequences.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

A New Implmentation and Detailed Study of Breakpoint Analysis.
Proceedings of the 6th Pacific Symposium on Biocomputing, 2001

New approaches for reconstructing phylogenies from gene order data.
Proceedings of the Ninth International Conference on Intelligent Systems for Molecular Biology, 2001

2000
A New Fast Heuristic for Computing the Breakpoint Phylogeny and Experimental Phylogenetic Analyses of Real and Synthetic Data.
Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics.
Proceedings of the Experimental Algorithmics, 2000

Algorithm Engineering for Parallel Computation.
Proceedings of the Experimental Algorithmics, 2000

1999
How to present a paper on experimental work with algorithms.
SIGACT News, 1999

Dynamical System Representation of Open Address Hash Functions.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Towards a discipline of experimental algorithmics.
Proceedings of the Data Structures, 1999

1998
Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids.
Inf. Process. Lett., 1998

Theory of computation.
Addison-Wesley-Longman, ISBN: 978-0-201-25828-8, 1998

1997
Workshop on algorithm engineering: a report.
SIGACT News, 1997

The Ice Rink Problem.
Proceedings of the Workshop on Algorithm Engineering, 1997

Map Labeling and Its Generalizations.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

1995
Network Routing Models Applied to Aircraft Routing Problems.
Proceedings of the 27th conference on Winter simulation, 1995

Folding a Simple Polygon: A Paradigm for Computational Geometry.
Proceedings of the 1995 ACM 23rd Annual Conference on Computer Science, CSC '95, Nashville, TN, USA, February 28, 1995

1993
An Exact Characterization of Greedy Structures.
SIAM J. Discret. Math., 1993

1992
Three-coloring the vertices of a triangulated simple polygon.
Pattern Recognit., 1992

An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree.
Proceedings of the Computational Support for Discrete Mathematics, 1992

1991
Constructive complexity.
Discret. Appl. Math., 1991

An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree.
Proceedings of the Algorithms and Data Structures, 1991

Folding a Triangulated Simple Polygon: Structural and Algorithmic Results.
Proceedings of the Advances in Computing and Information, 1991

How to Find a Minimum Spanning Tree in Practice.
Proceedings of the New Results and New Trends in Computer Science, 1991

1990
A new method for one-dimensional linear feature transformations.
Pattern Recognit., 1990

The design of a nonparametric hierarchical classifier.
Proceedings of the 10th IAPR International Conference on Pattern Recognition, 1990

1988
Planar NAE3SAT is in P.
SIGACT News, 1988

1983
Symmetric and Threshold Boolean Functions Are Exhaustive.
IEEE Trans. Computers, 1983

The Computational Metaphor and Quantum Physics.
Commun. ACM, 1983

1982
Decision Trees and Diagrams.
ACM Comput. Surv., 1982

1980
The Activity of a Variable and Its Relation to Decision Trees.
ACM Trans. Program. Lang. Syst., 1980


  Loading...