| 2009 | ||
|---|---|---|
| 78 | Nicholas D. Pattengale, Masoud Alipour, Olaf R. P. Bininda-Emonds, Bernard M. E. Moret, Alexandros Stamatakis: How Many Bootstrap Replicates Are Necessary?. RECOMB 2009: 184-200 | |
| 77 | Krister M. Swenson, Vaibhav Rajan, Yu Lin, Bernard M. E. Moret: Sorting Signed Permutations by Inversions in O(nlogn) Time. RECOMB 2009: 386-399 | |
| 76 | Xiuwei Zhang, Bernard M. E. Moret: Improving Inference of Transcriptional Regulatory Networks Based on Network Evolutionary Models. WABI 2009: 415-428 | |
| 75 | Krister M. Swenson, Bernard M. E. Moret: Inversion-based genomic signatures. BMC Bioinformatics 10(S-1): (2009) | |
| 74 | Krister M. Swenson, Yokuki To, Jijun Tang, Bernard M. E. Moret: Maximum independent sets of commuting and noninterfering inversions. BMC Bioinformatics 10(S-1): (2009) | |
| 2008 | ||
| 73 | Krister M. Swenson, William Arndt, Jijun Tang, Bernard M. E. Moret: Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes. APBC 2008: 241-250 | |
| 72 | Xiuwei Zhang, Maryam Zaheri, Bernard M. E. Moret: Using Phylogenetic Relationships to Improve the Inference of Transcriptional Regulatory Networks. BMEI (1) 2008: 186-193 | |
| 71 | Yu Lin, Bernard M. E. Moret: Estimating true evolutionary distances under the DCJ model. ISMB 2008: 114-122 | |
| 70 | Michael Brudno, Bernard M. E. Moret, C. Randal Linder, Tandy Warnow: Session Introduction. Pacific Symposium on Biocomputing 2008: 1-2 | |
| 69 | Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard M. E. Moret: Hurdles Hardly Have to Be Heeded. RECOMB-CG 2008: 241-251 | |
| 68 | Xiuwei Zhang, Bernard M. E. Moret: Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach. WABI 2008: 245-258 | |
| 67 | Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret: Approximating the true evolutionary distance between two genomes. ACM Journal of Experimental Algorithmics 12: (2008) | |
| 2007 | ||
| 66 | Moulik Kothari, Bernard M. E. Moret: An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations. CIBCB 2007: 151-158 | |
| 65 | Nicholas D. Pattengale, Eric J. Gottlieb, Bernard M. E. Moret: Efficiently Computing the Robinson-Foulds Metric. Journal of Computational Biology 14(6): 724-735 (2007) | |
| 2006 | ||
| 64 | Philipp Bucher, Bernard M. E. Moret: Algorithms in Bioinformatics, 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings Springer 2006 | |
| 63 | Liying Cui, Feng Yue, Claude W. dePamphilis, Bernard M. E. Moret, Jijun Tang: Inferring Ancestral Chloroplast Genomes with Inverted Repea. BIOCOMP 2006: 75-81 | |
| 62 | Nicholas D. Pattengale, Bernard M. E. Moret: A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric. RECOMB 2006: 221-230 | |
| 61 | M. M. Morin, Bernard M. E. Moret: NetGen: generating phylogenetic networks with diploid hybrids. Bioinformatics 22(15): 1921-1923 (2006) | |
| 2005 | ||
| 60 | Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret: Approximating the True Evolutionary Distance between Two Genomes. ALENEX/ANALCO 2005: 121-129 | |
| 59 | Bernard M. E. Moret: Computational Challenges from the Tree of Life. ALENEX/ANALCO 2005: 3-16 | |
| 58 | Tao Liu, Jijun Tang, Bernard M. E. Moret: Quartet-Based Phylogeny Reconstruction from Gene Orders. COCOON 2005: 63-73 | |
| 57 | Jijun Tang, Bernard M. E. Moret: Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements. CPM 2005: 406-416 | |
| 56 | Nicholas D. Pattengale, Bernard M. E. Moret: Phylogenetic Postprocessing. CSB Workshops 2005: 57-58 | |
| 55 | Krister M. Swenson, Nicholas D. Pattengale, Bernard M. E. Moret: A Framework for Orthology Assignment from Gene Rearrangement Data. Comparative Genomics 2005: 153-166 | |
| 2004 | ||
| 54 | Jijun Tang, Bernard M. E. Moret, Liying Cui, Claude W. dePamphilis: Phylogenetic Reconstruction from Arbitrary Gene-Order Data. BIBE 2004: 592-599 | |
| 53 | Usman Roshan, Bernard M. E. Moret, Tandy Warnow, Tiffani L. Williams: Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees. CSB 2004: 98-109 | |
| 52 | Joel V. Earnest-DeYoung, Emmanuelle Lerat, Bernard M. E. Moret: Reversing Gene Erosion - Reconstructing Ancestral Bacterial Genomes from Gene-Content and Order Data. WABI 2004: 1-13 | |
| 51 | 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. IEEE/ACM Trans. Comput. Biology Bioinform. 1(1): 13-23 (2004) | |
| 50 | Mark Marron, Krister M. Swenson, Bernard M. E. Moret: Genomic Distances under Deletions and Insertions. Theor. Comput. Sci. 325(3): 347-360 (2004) | |
| 2003 | ||
| 49 | Tiffani L. Williams, Bernard M. E. Moret: An Investigation of Phylogenetic Likelihood Methods. BIBE 2003: 79-86 | |
| 48 | Mark Marron, Krister M. Swenson, Bernard M. E. Moret: Genomic Distances under Deletions and Insertions. COCOON 2003: 537-547 | |
| 47 | Jijun Tang, Bernard M. E. Moret: Scaling up accurate phylogenetic reconstruction from gene-order data. ISMB (Supplement of Bioinformatics) 2003: 305-312 | |
| 46 | 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. Pacific Symposium on Biocomputing 2003: 315-326 | |
| 45 | Jijun Tang, Bernard M. E. Moret: Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content. WADS 2003: 37-46 | |
| 44 | Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. J. Algorithms 48(1): 173-193 (2003) | |
| 2002 | ||
| 43 | Rudolf Fleischer, Bernard M. E. Moret, Erik Meineche Schmidt: Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000] Springer 2002 | |
| 42 | Luay Nakhleh, Bernard M. E. Moret, Usman Roshan, Katherine St. John, Jerry Sun, Tandy Warnow: The Accuracy of Fast Phylogenetic Methods for Large Datasets. Pacific Symposium on Biocomputing 2002: 211-222 | |
| 41 | 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. Pacific Symposium on Biocomputing 2002: 524-535 | |
| 40 | Bernard M. E. Moret, Usman Roshan, Tandy Warnow: Sequence-Length Requirements for Phylogenetic Methods. WABI 2002: 343-356 | |
| 39 | Bernard M. E. Moret, Adam C. Siepel, Jijun Tang, Tao Liu: Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data. WABI 2002: 521-536 | |
| 38 | Bernard M. E. Moret, Li-San Wang, Tandy Warnow: Toward New Software for Computational Phylogenetics. IEEE Computer 35(7): 55-64 (2002) | |
| 37 | Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret: Point Set Labeling with Specified Positions. Int. J. Comput. Geometry Appl. 12(1-2): 29-66 (2002) | |
| 36 | Bernard M. E. Moret, Jijun Tang, Li-San Wang, Tandy Warnow: Steps toward accurate reconstructions of phylogenies from gene-order data. J. Comput. Syst. Sci. 65(3): 508-525 (2002) | |
| 35 | Bernard M. E. Moret, David A. Bader, Tandy Warnow: High-Performance Algorithm Engineering for Computational Phylogenetics. The Journal of Supercomputing 22(1): 99-111 (2002) | |
| 2001 | ||
| 34 | Olivier Gascuel, Bernard M. E. Moret: Algorithms in Bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings Springer 2001 | |
| 33 | 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. Algorithm Engineering 2001: 129-144 | |
| 32 | Bernard M. E. Moret, Li-San Wang, Tandy Warnow, Stacia K. Wyman: New approaches for reconstructing phylogenies from gene order data. ISMB (Supplement of Bioinformatics) 2001: 165-173 | |
| 31 | Bernard M. E. Moret, David A. Bader, Tandy Warnow: High-Performance Algorithm Engineering for Computational Phylogenetics. International Conference on Computational Science (2) 2001: 1012-1021 | |
| 30 | Bernard M. E. Moret, Stacia K. Wyman, David A. Bader, Tandy Warnow, Mi Yan: A New Implmentation and Detailed Study of Breakpoint Analysis. Pacific Symposium on Biocomputing 2001: 583-594 | |
| 29 | Tandy Warnow, Bernard M. E. Moret, Katherine St. John: Absolute convergence: true trees from short sequences. SODA 2001: 186-195 | |
| 28 | Katherine St. John, Tandy Warnow, Bernard M. E. Moret, Lisa Vawter: Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. SODA 2001: 196-205 | |
| 27 | Adam C. Siepel, Bernard M. E. Moret: Finding an Optimal Inversion Median: Experimental Results. WABI 2001: 189-203 | |
| 26 | David A. Bader, Bernard M. E. Moret, Mi Yan: A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. WADS 2001: 365-376 | |
| 25 | Bernard M. E. Moret: Foreword. J. Algorithms 38(1): 1 (2001) | |
| 24 | Bernard M. E. Moret, Henry D. Shapiro: Algorithms and Experiments: The New (and Old) Methodology. J. UCS 7(5): 434-446 (2001) | |
| 23 | David A. Bader, Bernard M. E. Moret, Mi Yan: A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. Journal of Computational Biology 8(5): 483-491 (2001) | |
| 2000 | ||
| 22 | David A. Bader, Bernard M. E. Moret, Peter Sanders: Algorithm Engineering for Parallel Computation. Experimental Algorithmics 2000: 1-23 | |
| 21 | Bernard M. E. Moret, Tandy Warnow: Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics. Experimental Algorithmics 2000: 163-180 | |
| 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. ISMB 2000: 104-115 | |
| 19 | Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret: Point set labeling with specified positions. Symposium on Computational Geometry 2000: 182-190 | |
| 1999 | ||
| 18 | Andrew V. Goldberg, Bernard M. E. Moret: Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. SODA 1999: 913-914 | |
| 17 | Gregory L. Heileman, Chaouki T. Abdallah, Bernard M. E. Moret, Bradley J. Smith: Dynamical System Representation of Open Address Hash Functions. SODA 1999: 919-920 | |
| 1998 | ||
| 16 | Michael J. Collins, Bernard M. E. Moret: Improved Lower Bounds for the Link Length of Rectilinear Spanning Paths in Grids. Inf. Process. Lett. 68(6): 317-319 (1998) | |
| 1997 | ||
| 15 | Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu: Map Labeling and Its Generalizations. SODA 1997: 148-157 | |
| 1995 | ||
| 14 | Ali A. Kooshesh, Bernard M. E. Moret: Folding a Simple Polygon: A Paradigm for Computational Geometry. ACM Conference on Computer Science 1995: 114-118 | |
| 13 | Zhiqiang Chen, Andrew T. Holle, Bernard M. E. Moret, Jared Saia, Ali Boroujerdi: Network Routing Models Applied to Aircraft Routing Problems. Winter Simulation Conference 1995: 1200-1206 | |
| 1993 | ||
| 12 | Paul Helman, Bernard M. E. Moret, Henry D. Shapiro: An Exact Characterization of Greedy Structures. SIAM J. Discrete Math. 6(2): 274-283 (1993) | |
| 1992 | ||
| 11 | Paul Helman, Bernard M. E. Moret, Henry D. Shapiro: An Exact Characterization of Greedy Structures. IPCO 1992: 287-297 | |
| 10 | Ali A. Kooshesh, Bernard M. E. Moret: Three-coloring the vertices of a triangulated simple polygon. Pattern Recognition 25(4): 443- (1992) | |
| 1991 | ||
| 9 | Ali A. Kooshesh, Bernard M. E. Moret: Folding a Triangulated Simple Polygon: Structural and Algorithmic Results. ICCI 1991: 102-110 | |
| 8 | Bernard M. E. Moret, Henry D. Shapiro: How to Find a Minimum Spanning Tree in Practice. New Results and New Trends in Computer Science 1991: 192-203 | |
| 7 | Bernard M. E. Moret, Henry D. Shapiro: An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. WADS 1991: 400-411 | |
| 6 | Karl R. Abrahamson, Michael R. Fellows, Michael A. Langston, Bernard M. E. Moret: Constructive complexity. Discrete Applied Mathematics 34(1-3): 3-16 (1991) | |
| 1990 | ||
| 5 | Chea-Tin (Tim) Tseng, Bernard M. E. Moret: A new method for one-dimensional linear feature transformations. Pattern Recognition 23(7): 745-752 (1990) | |
| 1983 | ||
| 4 | Michael J. Mathey, Bernard M. E. Moret: The Computational Metaphor and Quantum Physics. Commun. ACM 26(2): 137-145 (1983) | |
| 3 | Bernard M. E. Moret, Michael G. Thomason, Rafael C. Gonzalez: Symmetric and Threshold Boolean Functions Are Exhaustive. IEEE Trans. Computers 32(12): 1211-1212 (1983) | |
| 1982 | ||
| 2 | Bernard M. E. Moret: Decision Trees and Diagrams. ACM Comput. Surv. 14(4): 593-623 (1982) | |
| 1980 | ||
| 1 | Bernard M. E. Moret, Michael G. Thomason, Rafael C. Gonzalez: The Activity of a Variable and Its Relation to Decision Trees. ACM Trans. Program. Lang. Syst. 2(4): 580-595 (1980) | |