The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bernard M. E. Moret: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bernard M. E. Moret
    Decision Trees and Diagrams. [Citation Graph (2, 0)][DBLP]
    ACM Comput. Surv., 1982, v:14, n:4, pp:593-623 [Journal]
  2. Ali A. Kooshesh, Bernard M. E. Moret
    Folding a Simple Polygon: A Paradigm for Computational Geometry. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer Science, 1995, pp:114-118 [Conf]
  3. Bernard M. E. Moret
    Computational Challenges from the Tree of Life. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:3-16 [Conf]
  4. Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret
    Approximating the True Evolutionary Distance between Two Genomes. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:121-129 [Conf]
  5. Tiffani L. Williams, Bernard M. E. Moret
    An Investigation of Phylogenetic Likelihood Methods. [Citation Graph (0, 0)][DBLP]
    BIBE, 2003, pp:79-86 [Conf]
  6. Jijun Tang, Bernard M. E. Moret, Liying Cui, Claude W. dePamphilis
    Phylogenetic Reconstruction from Arbitrary Gene-Order Data. [Citation Graph (0, 0)][DBLP]
    BIBE, 2004, pp:592-599 [Conf]
  7. Liying Cui, Feng Yue, Claude W. dePamphilis, Bernard M. E. Moret, Jijun Tang
    Inferring Ancestral Chloroplast Genomes with Inverted Repea. [Citation Graph (0, 0)][DBLP]
    BIOCOMP, 2006, pp:75-81 [Conf]
  8. Bernard M. E. Moret, Henry D. Shapiro
    How to Find a Minimum Spanning Tree in Practice. [Citation Graph (0, 0)][DBLP]
    New Results and New Trends in Computer Science, 1991, pp:192-203 [Conf]
  9. Tao Liu, Jijun Tang, Bernard M. E. Moret
    Quartet-Based Phylogeny Reconstruction from Gene Orders. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:63-73 [Conf]
  10. Mark Marron, Krister M. Swenson, Bernard M. E. Moret
    Genomic Distances under Deletions and Insertions. [Citation Graph (0, 0)][DBLP]
    COCOON, 2003, pp:537-547 [Conf]
  11. Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret
    Point set labeling with specified positions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:182-190 [Conf]
  12. Jijun Tang, Bernard M. E. Moret
    Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:406-416 [Conf]
  13. Usman Roshan, Bernard M. E. Moret, Tandy Warnow, Tiffani L. Williams
    Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees. [Citation Graph (0, 0)][DBLP]
    CSB, 2004, pp:98-109 [Conf]
  14. Nicholas D. Pattengale, Bernard M. E. Moret
    Phylogenetic Postprocessing. [Citation Graph (0, 0)][DBLP]
    CSB Workshops, 2005, pp:57-58 [Conf]
  15. David A. Bader, Bernard M. E. Moret, Peter Sanders
    Algorithm Engineering for Parallel Computation. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:1-23 [Conf]
  16. Bernard M. E. Moret, Tandy Warnow
    Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics. [Citation Graph (0, 0)][DBLP]
    Experimental Algorithmics, 2000, pp:163-180 [Conf]
  17. Bernard M. E. Moret, David A. Bader, Tandy Warnow
    High-Performance Algorithm Engineering for Computational Phylogenetics. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2001, pp:1012-1021 [Conf]
  18. Ali A. Kooshesh, Bernard M. E. Moret
    Folding a Triangulated Simple Polygon: Structural and Algorithmic Results. [Citation Graph (0, 0)][DBLP]
    ICCI, 1991, pp:102-110 [Conf]
  19. Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
    An Exact Characterization of Greedy Structures. [Citation Graph (0, 0)][DBLP]
    IPCO, 1992, pp:287-297 [Conf]
  20. Mary E. Cosner, Robert K. Jansen, Bernard M. E. Moret, Linda A. Raubeson, Li-San Wang, Tandy Warnow, Stacia K. Wyman
    A New Fast Heuristic for Computing the Breakpoint Phylogeny and Experimental Phylogenetic Analyses of Real and Synthetic Data. [Citation Graph (0, 0)][DBLP]
    ISMB, 2000, pp:104-115 [Conf]
  21. Bernard M. E. Moret, Li-San Wang, Tandy Warnow, Stacia K. Wyman
    New approaches for reconstructing phylogenies from gene order data. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2001, pp:165-173 [Conf]
  22. Jijun Tang, Bernard M. E. Moret
    Scaling up accurate phylogenetic reconstruction from gene-order data. [Citation Graph (0, 0)][DBLP]
    ISMB (Supplement of Bioinformatics), 2003, pp:305-312 [Conf]
  23. Bernard M. E. Moret, Stacia K. Wyman, David A. Bader, Tandy Warnow, Mi Yan
    A New Implmentation and Detailed Study of Breakpoint Analysis. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2001, pp:583-594 [Conf]
  24. Luay Nakhleh, Bernard M. E. Moret, Usman Roshan, Katherine St. John, Jerry Sun, Tandy Warnow
    The Accuracy of Fast Phylogenetic Methods for Large Datasets. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2002, pp:211-222 [Conf]
  25. Luay Nakhleh, Jerry Sun, Tandy Warnow, C. Randal Linder, Bernard M. E. Moret, Anna Tholse
    Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2003, pp:315-326 [Conf]
  26. Li-San Wang, Robert K. Jansen, Bernard M. E. Moret, Linda A. Raubeson, Tandy Warnow
    Fast Phylogenetic Methods for the Analysis of Genome Rearrangement Data: An Empirical Study. [Citation Graph (0, 0)][DBLP]
    Pacific Symposium on Biocomputing, 2002, pp:524-535 [Conf]
  27. Nicholas D. Pattengale, Bernard M. E. Moret
    A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:221-230 [Conf]
  28. Krister M. Swenson, Nicholas D. Pattengale, Bernard M. E. Moret
    A Framework for Orthology Assignment from Gene Rearrangement Data. [Citation Graph (0, 0)][DBLP]
    Comparative Genomics, 2005, pp:153-166 [Conf]
  29. Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu
    Map Labeling and Its Generalizations. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:148-157 [Conf]
  30. Andrew V. Goldberg, Bernard M. E. Moret
    Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:913-914 [Conf]
  31. Gregory L. Heileman, Chaouki T. Abdallah, Bernard M. E. Moret, Bradley J. Smith
    Dynamical System Representation of Open Address Hash Functions. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:919-920 [Conf]
  32. Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter
    Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:196-205 [Conf]
  33. Tandy Warnow, Bernard M. E. Moret, Katherine St. John
    Absolute convergence: true trees from short sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:186-195 [Conf]
  34. Joel V. Earnest-DeYoung, Emmanuelle Lerat, Bernard M. E. Moret
    Reversing Gene Erosion - Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:1-13 [Conf]
  35. Bernard M. E. Moret, Usman Roshan, Tandy Warnow
    Sequence-Length Requirements for Phylogenetic Methods. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:343-356 [Conf]
  36. Bernard M. E. Moret, Adam C. Siepel, Jijun Tang, Tao Liu
    Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data. [Citation Graph (0, 0)][DBLP]
    WABI, 2002, pp:521-536 [Conf]
  37. Adam C. Siepel, Bernard M. E. Moret
    Finding an Optimal Inversion Median: Experimental Results. [Citation Graph (0, 0)][DBLP]
    WABI, 2001, pp:189-203 [Conf]
  38. David A. Bader, Bernard M. E. Moret, Mi Yan
    A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:365-376 [Conf]
  39. Bernard M. E. Moret, Henry D. Shapiro
    An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:400-411 [Conf]
  40. Jijun Tang, Bernard M. E. Moret
    Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:37-46 [Conf]
  41. David A. Bader, Ajith K. Illendula, Bernard M. E. Moret, Nina R. Weisse-Bernstein
    Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:129-144 [Conf]
  42. Zhiqiang Chen, Andrew T. Holle, Bernard M. E. Moret, Jared Saia, Ali Boroujerdi
    Network Routing Models Applied to Aircraft Routing Problems. [Citation Graph (0, 0)][DBLP]
    Winter Simulation Conference, 1995, pp:1200-1206 [Conf]
  43. M. M. Morin, B. M. E. Moret
    NetGen: generating phylogenetic networks with diploid hybrids. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2006, v:22, n:15, pp:1921-1923 [Journal]
  44. Michael J. Mathey, Bernard M. E. Moret
    The Computational Metaphor and Quantum Physics. [Citation Graph (0, 0)][DBLP]
    Commun. ACM, 1983, v:26, n:2, pp:137-145 [Journal]
  45. Bernard M. E. Moret, Li-San Wang, Tandy Warnow
    Toward New Software for Computational Phylogenetics. [Citation Graph (0, 0)][DBLP]
    IEEE Computer, 2002, v:35, n:7, pp:55-64 [Journal]
  46. Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret
    Point Set Labeling with Specified Positions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:1-2, pp:29-66 [Journal]
  47. Michael J. Collins, Bernard M. E. Moret
    Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:6, pp:317-319 [Journal]
  48. Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter
    Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:1, pp:173-193 [Journal]
  49. Bernard M. E. Moret
    Foreword. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2001, v:38, n:1, pp:1- [Journal]
  50. David A. Bader, Bernard M. E. Moret, Mi Yan
    A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2001, v:8, n:5, pp:483-491 [Journal]
  51. Bernard M. E. Moret, Jijun Tang, Li-San Wang, Tandy Warnow
    Steps toward accurate reconstructions of phylogenies from gene-order data. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2002, v:65, n:3, pp:508-525 [Journal]
  52. Bernard M. E. Moret, Henry D. Shapiro
    Algorithms and Experiments: The New (and Old) Methodology. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2001, v:7, n:5, pp:434-446 [Journal]
  53. Ali A. Kooshesh, Bernard M. E. Moret
    Three-coloring the vertices of a triangulated simple polygon. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1992, v:25, n:4, pp:443-0 [Journal]
  54. Chea-Tin (Tim) Tseng, Bernard M. E. Moret
    A new method for one-dimensional linear feature transformations. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 1990, v:23, n:7, pp:745-752 [Journal]
  55. Paul Helman, Bernard M. E. Moret, Henry D. Shapiro
    An Exact Characterization of Greedy Structures. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:2, pp:274-283 [Journal]
  56. Bernard M. E. Moret, Michael G. Thomason, Rafael C. Gonzalez
    Symmetric and Threshold Boolean Functions Are Exhaustive. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1983, v:32, n:12, pp:1211-1212 [Journal]
  57. Bernard M. E. Moret, Luay Nakhleh, Tandy Warnow, C. Randal Linder, Anna Tholse, Anneke Padolina, Jerry Sun, Ruth E. Timme
    Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy. [Citation Graph (0, 0)][DBLP]
    IEEE/ACM Trans. Comput. Biology Bioinform., 2004, v:1, n:1, pp:13-23 [Journal]
  58. Mark Marron, Krister M. Swenson, Bernard M. E. Moret
    Genomic Distances under Deletions and Insertions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:325, n:3, pp:347-360 [Journal]
  59. Bernard M. E. Moret, David A. Bader, Tandy Warnow
    High-Performance Algorithm Engineering for Computational Phylogenetics. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2002, v:22, n:1, pp:99-111 [Journal]
  60. Bernard M. E. Moret, Michael G. Thomason, Rafael C. Gonzalez
    The Activity of a Variable and Its Relation to Decision Trees. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1980, v:2, n:4, pp:580-595 [Journal]

  61. Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes. [Citation Graph (, )][DBLP]


  62. An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations. [Citation Graph (, )][DBLP]


  63. Estimating true evolutionary distances under the DCJ model. [Citation Graph (, )][DBLP]


  64. Session Introduction. [Citation Graph (, )][DBLP]


  65. Hurdles Hardly Have to Be Heeded. [Citation Graph (, )][DBLP]


  66. Sorting Signed Permutations by Inversions in O(nlogn) Time. [Citation Graph (, )][DBLP]


  67. How Many Bootstrap Replicates Are Necessary?. [Citation Graph (, )][DBLP]


  68. Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach. [Citation Graph (, )][DBLP]


  69. Improving Inference of Transcriptional Regulatory Networks Based on Network Evolutionary Models. [Citation Graph (, )][DBLP]


  70. Uncovering Hidden Phylogenetic Consensus. [Citation Graph (, )][DBLP]


  71. Using Phylogenetic Relationships to Improve the Inference of Transcriptional Regulatory Networks. [Citation Graph (, )][DBLP]


  72. Inversion-based genomic signatures. [Citation Graph (, )][DBLP]


  73. Maximum independent sets of commuting and noninterfering inversions. [Citation Graph (, )][DBLP]


  74. Heuristics for the inversion median problem. [Citation Graph (, )][DBLP]


  75. Estimating true evolutionary distances under rearrangements, duplications, and losses. [Citation Graph (, )][DBLP]


  76. Constructive complexity. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.011secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002