default search action
Bernard M. E. Moret
Person information
- affiliation: EPFL, Lausanne, Switzerland
- affiliation (1980 - 2006): University of New Mexico, Albuquerque, NM, USA
- affiliation (PhD 1980): University of Tennessee, Knoxville, TN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [i1]Daniel Doerr, Bernard M. E. Moret:
Fast computation of approximate weak common intervals in multiple indeterminate strings. CoRR abs/2304.02657 (2023)
2010 – 2019
- 2017
- [j52]Mingfu Shao, Bernard M. E. Moret:
On Computing Breakpoint Distances for Genomes with Duplicate Genes. J. Comput. Biol. 24(6): 571-580 (2017) - [j51]Daniel Doerr, Luis Antonio Brasil Kowada, Eloi Araujo, Shachi Deshpande, Simone Dantas, Bernard M. E. Moret, Jens Stoye
:
New Genome Similarity Measures based on Conserved Gene Adjacencies. J. Comput. Biol. 24(6): 616-634 (2017) - 2016
- [j50]Nishanth Ulhas Nair
A maximum-likelihood approach for building cell-type trees by lifting. BMC Genom. 17(S-1): 14 (2016) - [j49]Mingfu Shao, Bernard M. E. Moret
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance. J. Comput. Biol. 23(5): 337-346 (2016) - [c77]Min Ye, Gabriela C. Racz, Qijia Jiang, Xiuwei Zhang, Bernard M. E. Moret
NEMo: An Evolutionary Model with Modularity for PPI Networks. ISBRA 2016: 224-236 - [c76]Mingfu Shao, Bernard M. E. Moret
On Computing Breakpoint Distances for Genomes with Duplicate Genes. RECOMB 2016: 189-203 - 2015
- [j48]Mingfu Shao, Bernard M. E. Moret
Comparing genomes with rearrangements and segmental duplications. Bioinform. 31(12): 329-338 (2015) - [j47]Mingfu Shao, Yu Lin
An Exact Algorithm to Compute the Double-Cut-and-Join Distance for Genomes with Duplicate Genes. J. Comput. Biol. 22(5): 425-435 (2015) - [c75]Mingfu Shao, Bernard M. E. Moret
A Fast and Exact Algorithm for the Exemplar Breakpoint Distance. RECOMB 2015: 309-322 - 2014
- [j46]Cristina G. Ghiurcuta, Bernard M. E. Moret
Evaluating synteny for improved comparative studies. Bioinform. 30(12): 9-18 (2014) - [j45]Nishanth Ulhas Nair
Probabilistic partitioning methods to find significant patterns in ChIP-Seq data. Bioinform. 30(17): 2406-2413 (2014) - [j44]Nishanth Ulhas Nair
Study of cell differentiation by phylogenetic analysis using histone modification data. BMC Bioinform. 15: 269 (2014) - [c74]Mingfu Shao, Bernard M. E. Moret
On the DCJ Median Problem. CPM 2014: 273-282 - [c73]Mingfu Shao, Yu Lin
An Exact Algorithm to Compute the DCJ Distance for Genomes with Duplicate Genes. RECOMB 2014: 280-292 - 2013
- [j43]Mingfu Shao, Yu Lin
Sorting genomes with rearrangements and segmental duplications through trajectory graphs. BMC Bioinform. 14(S-15): S9 (2013) - [j42]Yann Christinat
A Transcript Perspective on Evolution. IEEE ACM Trans. Comput. Biol. Bioinform. 10(6): 1403-1411 (2013) - [c72]Yu Lin, Fei Hu, Jijun Tang, Bernard M. E. Moret:
Maximum Likelihood Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Tree of 68 Eukaryotes. Pacific Symposium on Biocomputing 2013: 285-296 - [c71]Bernard M. E. Moret
Extending the Reach of Phylogenetic Inference. WABI 2013: 1-2 - [c70]Nishanth Ulhas Nair
Phylogenetic Analysis of Cell Types Using Histone Modifications. WABI 2013: 326-337 - [p2]Bernard M. E. Moret, Yu Lin
Rearrangements in Phylogenetic Inference: Compare, Model, or Encode? Models and Algorithms for Genome Evolution 2013: 147-171 - 2012
- [j41]Yu Lin
Bootstrapping phylogenies inferred from rearrangement data. Algorithms Mol. Biol. 7: 21 (2012) - [j40]Yu Lin
TIBA: a tool for phylogeny inference from rearrangement data with bootstrap analysis. Bioinform. 28(24): 3324-3325 (2012) - [j39]Yann Christinat, Bernard M. E. Moret:
Inferring transcript phylogenies. BMC Bioinform. 13(S-9): S1 (2012) - [j38]Yu Lin
A Metric for Phylogenetic Trees Based on Matching. IEEE ACM Trans. Comput. Biol. Bioinform. 9(4): 1014-1022 (2012) - [j37]Xiuwei Zhang, Bernard M. E. Moret
Refining Regulatory Networks through Phylogenetic Transfer of Information. IEEE ACM Trans. Comput. Biol. Bioinform. 9(4): 1032-1045 (2012) - [c69]Yann Christinat
A Transcript Perspective on Evolution. ISBRA 2012: 48-59 - 2011
- [j36]Yu Lin
A New Genomic Evolutionary Model for Rearrangements, Duplications, and Losses that Applies across Eukaryotes and Prokaryotes. J. Comput. Biol. 18(9): 1055-1064 (2011) - [j35]Yu Lin
Fast and Accurate Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Novel Robustness Estimator. J. Comput. Biol. 18(9): 1131-1139 (2011) - [j34]Nicholas D. Pattengale, Andre J. Aberer, Krister M. Swenson, Alexandros Stamatakis
Uncovering Hidden Phylogenetic Consensus in Large Data Sets. IEEE ACM Trans. Comput. Biol. Bioinform. 8(4): 902-911 (2011) - [c68]Yann Christinat
Inferring Transcript Phylogenies. BIBM 2011: 208-215 - [c67]Bernard M. E. Moret
Phylogenetic Analysis of Whole Genomes - (Keynote Talk). ISBRA 2011: 4-7 - [c66]Yu Lin
A Metric for Phylogenetic Trees Based on Matching. ISBRA 2011: 197-208 - [c65]Xiuwei Zhang, Bernard M. E. Moret
ProPhyC: A Probabilistic Phylogenetic Model for Refining Regulatory Networks. ISBRA 2011: 344-357 - [c64]Yu Lin
Bootstrapping Phylogenies Inferred from Rearrangement Data. WABI 2011: 175-187 - [c63]Andrew Wei Xu, Bernard M. E. Moret
GASTS: Parsimony Scoring under Rearrangements. WABI 2011: 351-363 - 2010
- [j33]Xiuwei Zhang, Bernard M. E. Moret
Refining transcriptional regulatory networks using network evolutionary models and gene histories. Algorithms Mol. Biol. 5: 1 (2010) - [j32]Vaibhav Rajan
Heuristics for the inversion median problem. BMC Bioinform. 11(S-1): 30 (2010) - [j31]Yu Lin
Estimating true evolutionary distances under rearrangements, duplications, and losses. BMC Bioinform. 11(S-1): 54 (2010) - [j30]Nicholas D. Pattengale, Masoud Alipour, Olaf R. P. Bininda-Emonds
How Many Bootstrap Replicates Are Necessary? J. Comput. Biol. 17(3): 337-354 (2010) - [j29]Krister M. Swenson, Vaibhav Rajan
Sorting Signed Permutations by Inversions in O(nlogn) Time. J. Comput. Biol. 17(3): 489-501 (2010) - [c62]Alisa Yurovsky, Bernard M. E. Moret
FluRF, an automated flu virus reassortment finder based on phylogenetic trees. BIBM 2010: 579-584 - [c61]Nicholas D. Pattengale, Krister M. Swenson, Bernard M. E. Moret
Uncovering Hidden Phylogenetic Consensus. ISBRA 2010: 128-139 - [c60]Bernard M. E. Moret, Webb Miller, Pavel A. Pevzner, David Sankoff:
Session Introduction. Pacific Symposium on Biocomputing 2010: 1-2 - [c59]Yu Lin
Fast and Accurate Phylogenetic Reconstruction from High-Resolution Whole-Genome Data and a Novel Robustness Estimator. RECOMB-CG 2010: 137-148 - [c58]Yu Lin
A New Genomic Evolutionary Model for Rearrangements, Duplications, and Losses That Applies across Eukaryotes and Prokaryotes. RECOMB-CG 2010: 228-239
2000 – 2009
- 2009
- [j28]Krister M. Swenson, Bernard M. E. Moret
Inversion-based genomic signatures. BMC Bioinform. 10(S-1) (2009) - [j27]Krister M. Swenson, Yokuki To, Jijun Tang, Bernard M. E. Moret
Maximum independent sets of commuting and noninterfering inversions. BMC Bioinform. 10(S-1) (2009) - [j26]Krister M. Swenson, Yu Lin
Hurdles and Sorting by Inversions: Combinatorial, Statistical, and Experimental Results. J. Comput. Biol. 16(10): 1339-1351 (2009) - [c57]Bernard M. E. Moret, Webb Miller, Pavel A. Pevzner, David Sankoff:
Session Introduction. Pacific Symposium on Biocomputing 2009: 111-113 - [c56]Nicholas D. Pattengale, Masoud Alipour, Olaf R. P. Bininda-Emonds, Bernard M. E. Moret
How Many Bootstrap Replicates Are Necessary? RECOMB 2009: 184-200 - [c55]Krister M. Swenson, Vaibhav Rajan
Sorting Signed Permutations by Inversions in O(nlogn) Time. RECOMB 2009: 386-399 - [c54]Xiuwei Zhang, Bernard M. E. Moret
Improving Inference of Transcriptional Regulatory Networks Based on Network Evolutionary Models. WABI 2009: 415-428 - 2008
- [j25]Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret
Approximating the true evolutionary distance between two genomes. ACM J. Exp. Algorithmics 12: 3.5:1-3.5:17 (2008) - [c53]Krister M. Swenson, William Arndt, Jijun Tang, Bernard M. E. Moret:
Phylogenetic Reconstruction from Complete Gene Orders of Whole Genomes. APBC 2008: 241-250 - [c52]Xiuwei Zhang, Maryam Zaheri, Bernard M. E. Moret
Using Phylogenetic Relationships to Improve the Inference of Transcriptional Regulatory Networks. BMEI (1) 2008: 186-193 - [c51]Yu Lin
Estimating true evolutionary distances under the DCJ model. ISMB 2008: 114-122 - [c50]Michael Brudno, Bernard M. E. Moret, C. Randal Linder, Tandy J. Warnow:
Session Introduction. Pacific Symposium on Biocomputing 2008: 1-2 - [c49]Krister M. Swenson, Yu Lin
Hurdles Hardly Have to Be Heeded. RECOMB-CG 2008: 241-251 - [c48]Xiuwei Zhang, Bernard M. E. Moret
Boosting the Performance of Inference Algorithms for Transcriptional Regulatory Networks Using a Phylogenetic Approach. WABI 2008: 245-258 - 2007
- [j24]Nicholas D. Pattengale, Eric J. Gottlieb, Bernard M. E. Moret
Efficiently Computing the Robinson-Foulds Metric. J. Comput. Biol. 14(6): 724-735 (2007) - [c47]Moulik Kothari, Bernard M. E. Moret:
An Experimental Evaluation of Inversion-and Transposition-Based Genomic Distances through Simulations. CIBCB 2007: 151-158 - [p1]Bernard M. E. Moret, Jijun Tang, Tandy J. Warnow:
Reconstructing phylogenies from gene-content and gene-order data. Mathematics of Evolution and Phylogeny 2007 - 2006
- [j23]M. M. Morin, Bernard M. E. Moret
NetGen: generating phylogenetic networks with diploid hybrids. Bioinform. 22(15): 1921-1923 (2006) - [c46]Liying Cui, Feng Yue, Claude W. dePamphilis, Bernard M. E. Moret, Jijun Tang:
Inferring Ancestral Chloroplast Genomes with Inverted Repea. BIOCOMP 2006: 75-81 - [c45]Nicholas D. Pattengale, Bernard M. E. Moret
A Sublinear-Time Randomized Approximation Scheme for the Robinson-Foulds Metric. RECOMB 2006: 221-230 - [e3]Philipp Bucher, Bernard M. E. Moret:
Algorithms in Bioinformatics, 6th International Workshop, WABI 2006, Zurich, Switzerland, September 11-13, 2006, Proceedings. Lecture Notes in Computer Science 4175, Springer 2006, ISBN 3-540-39583-0 [contents] - 2005
- [c44]Bernard M. E. Moret:
Computational Challenges from the Tree of Life. ALENEX/ANALCO 2005: 3-16 - [c43]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 - [c42]Tao Liu, Jijun Tang, Bernard M. E. Moret:
Quartet-Based Phylogeny Reconstruction from Gene Orders. COCOON 2005: 63-73 - [c41]Jijun Tang, Bernard M. E. Moret:
Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements. CPM 2005: 406-416 - [c40]Nicholas D. Pattengale, Bernard M. E. Moret
Phylogenetic Postprocessing. CSB Workshops 2005: 57-58 - [c39]Mahesh M. Kulkarni, Bernard M. E. Moret
Consensus Methods Using Phylogenetic Databases. CSB Workshops 2005: 61-62 - [c38]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
- [j22]Bernard M. E. Moret
Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy. IEEE ACM Trans. Comput. Biol. Bioinform. 1(1): 13-23 (2004) - [j21]Mark Marron, Krister M. Swenson, Bernard M. E. Moret
Genomic Distances under Deletions and Insertions. Theor. Comput. Sci. 325(3): 347-360 (2004) - [c37]Jijun Tang, Bernard M. E. Moret, Liying Cui, Claude W. dePamphilis:
Phylogenetic Reconstruction from Arbitrary Gene-Order Data. BIBE 2004: 592-599 - [c36]Usman Roshan, Bernard M. E. Moret, Tandy J. Warnow, Tiffani L. Williams:
Rec-I-DCM3: A Fast Algorithmic Technique for Reconstructing Large Phylogenetic Trees. CSB 2004: 98-109 - [c35]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 - 2003
- [j20]Katherine St. John, Tandy J. Warnow, Bernard M. E. Moret
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. J. Algorithms 48(1): 173-193 (2003) - [c34]Tiffani L. Williams, Bernard M. E. Moret
An Investigation of Phylogenetic Likelihood Methods. BIBE 2003: 79-86 - [c33]Mark Marron, Krister M. Swenson, Bernard M. E. Moret:
Genomic Distances under Deletions and Insertions. COCOON 2003: 537-547 - [c32]Jijun Tang, Bernard M. E. Moret:
Scaling up accurate phylogenetic reconstruction from gene-order data. ISMB (Supplement of Bioinformatics) 2003: 305-312 - [c31]Luay Nakhleh, Jerry Sun, Tandy J. 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 - [c30]Jijun Tang, Bernard M. E. Moret:
Phylogenetic Reconstruction from Gene-Rearrangement Data with Unequal Gene Content. WADS 2003: 37-46 - 2002
- [j19]Bernard M. E. Moret
Toward New Software for Computational Phylogenetics. Computer 35(7): 55-64 (2002) - [j18]Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret:
Point Set Labeling with Specified Positions. Int. J. Comput. Geom. Appl. 12(1-2): 29-66 (2002) - [j17]Bernard M. E. Moret
Steps toward accurate reconstructions of phylogenies from gene-order data. J. Comput. Syst. Sci. 65(3): 508-525 (2002) - [j16]Bernard M. E. Moret
High-Performance Algorithm Engineering for Computational Phylogenetics. J. Supercomput. 22(1): 99-111 (2002) - [c29]Luay Nakhleh, Bernard M. E. Moret, Usman Roshan, Katherine St. John, Jerry Sun, Tandy J. Warnow:
The Accuracy of Fast Phylogenetic Methods for Large Datasets. Pacific Symposium on Biocomputing 2002: 211-222 - [c28]Li-San Wang, Robert K. Jansen, Bernard M. E. Moret, Linda A. Raubeson, Tandy J. Warnow:
Fast Phylogenetic Methods for the Analysis of Genome Rearrangement Data: An Empirical Study. Pacific Symposium on Biocomputing 2002: 524-535 - [c27]Bernard M. E. Moret, Usman Roshan, Tandy J. Warnow:
Sequence-Length Requirements for Phylogenetic Methods. WABI 2002: 343-356 - [c26]Bernard M. E. Moret, Adam C. Siepel
Inversion Medians Outperform Breakpoint Medians in Phylogeny Reconstruction from Gene-Order Data. WABI 2002: 521-536 - [e2]Rudolf Fleischer, Bernard M. E. Moret, Erik Meineche Schmidt:
Experimental Algorithmics, From Algorithm Design to Robust and Efficient Software [Dagstuhl seminar, September 2000]. Lecture Notes in Computer Science 2547, Springer 2002, ISBN 3-540-00346-0 [contents] - 2001
- [j15]Bernard M. E. Moret:
Foreword. J. Algorithms 38(1): 1 (2001) - [j14]David A. Bader
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. J. Comput. Biol. 8(5): 483-491 (2001) - [j13]Bernard M. E. Moret, Henry D. Shapiro:
Algorithms and Experiments: The New (and Old) Methodology. J. Univers. Comput. Sci. 7(5): 434-446 (2001) - [c25]Bernard M. E. Moret
High-Performance Algorithm Engineering for Computational Phylogenetics. International Conference on Computational Science (2) 2001: 1012-1021 - [c24]Bernard M. E. Moret, Li-San Wang, Tandy J. Warnow, Stacia K. Wyman:
New approaches for reconstructing phylogenies from gene order data. ISMB (Supplement of Bioinformatics) 2001: 165-173 - [c23]Bernard M. E. Moret, Stacia K. Wyman, David A. Bader
A New Implmentation and Detailed Study of Breakpoint Analysis. Pacific Symposium on Biocomputing 2001: 583-594 - [c22]Tandy J. Warnow, Bernard M. E. Moret, Katherine St. John:
Absolute convergence: true trees from short sequences. SODA 2001: 186-195 - [c21]Katherine St. John, Tandy J. Warnow, Bernard M. E. Moret, Lisa Vawter:
Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining. SODA 2001: 196-205 - [c20]Adam C. Siepel
Finding an Optimal Inversion Median: Experimental Results. WABI 2001: 189-203 - [c19]David A. Bader
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study. WADS 2001: 365-376 - [c18]David A. Bader
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture. WAE 2001: 129-144 - [e1]Olivier Gascuel, Bernard M. E. Moret:
Algorithms in Bioinformatics, First International Workshop, WABI 2001, Aarhus, Denmark, August 28-31, 2001, Proceedings. Lecture Notes in Computer Science 2149, Springer 2001, ISBN 3-540-42516-0 [contents] - 2000
- [c17]Srinivas Doddi, Madhav V. Marathe, Bernard M. E. Moret:
Point set labeling with specified positions. SCG 2000: 182-190 - [c16]David A. Bader
Algorithm Engineering for Parallel Computation. Experimental Algorithmics 2000: 1-23 - [c15]Bernard M. E. Moret, Tandy J. Warnow:
Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics. Experimental Algorithmics 2000: 163-180 - [c14]Mary E. Cosner, Robert K. Jansen, Bernard M. E. Moret, Linda A. Raubeson, Li-San Wang, Tandy J. 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
1990 – 1999
- 1999
- [j12]Catherine C. McGeoch, Bernard M. E. Moret:
How to present a paper on experimental work with algorithms. SIGACT News 30(4): 85-90 (1999) - [c13]Bernard M. E. Moret:
Towards a discipline of experimental algorithmics. Data Structures, Near Neighbor Searches, and Methodology 1999: 197-213 - [c12]Andrew V. Goldberg, Bernard M. E. Moret:
Combinatorial Algorithms Test Sets [CATS]: The ACM/EATCS Platform for Experimental Research. SODA 1999: 913-914 - [c11]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
- [b1]Bernard M. E. Moret:
Theory of computation. Addison-Wesley-Longman 1998, ISBN 978-0-201-25828-8, pp. I-XX, 1-453 - [j11]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
- [j10]Bernard M. E. Moret:
Workshop on algorithm engineering: a report. SIGACT News 28(4): 77-79 (1997) - [c10]Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M. E. Moret, Binhai Zhu:
Map Labeling and Its Generalizations. SODA 1997: 148-157 - [c9]Bernard M. E. Moret, Michael J. Collins, Jared Saia, Ling Yu:
The Ice Rink Problem. WAE 1997: 104-111 - 1995
- [c8]Ali A. Kooshesh, Bernard M. E. Moret:
Folding a Simple Polygon: A Paradigm for Computational Geometry. ACM Conference on Computer Science 1995: 114-118 - [c7]Zhiqiang Chen, Andrew T. Holle, Bernard M. E. Moret, Jared Saia, Ali Boroujerdi:
Network Routing Models Applied to Aircraft Routing Problems. WSC 1995: 1200-1206 - 1993
- [j9]Paul Helman, Bernard M. E. Moret, Henry D. Shapiro:
An Exact Characterization of Greedy Structures. SIAM J. Discret. Math. 6(2): 274-283 (1993) - 1992
- [j8]Ali A. Kooshesh, Bernard M. E. Moret
Three-coloring the vertices of a triangulated simple polygon. Pattern Recognit. 25(4): 443- (1992) - [c6]Bernard M. E. Moret, Henry D. Shapiro:
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree. Computational Support for Discrete Mathematics 1992: 99-117 - [c5]Paul Helman, Bernard M. E. Moret, Henry D. Shapiro:
An Exact Characterization of Greedy Structures. IPCO 1992: 287-297 - 1991
- [j7]Karl R. Abrahamson, Michael R. Fellows
Constructive complexity. Discret. Appl. Math. 34(1-3): 3-16 (1991) - [c4]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 - [c3]Ali A. Kooshesh, Bernard M. E. Moret:
Folding a Triangulated Simple Polygon: Structural and Algorithmic Results. ICCI 1991: 102-110 - [c2]Bernard M. E. Moret, Henry D. Shapiro:
An Emperical Analysis of Algorithms for Constructing a Minimum Spanning Tree. WADS 1991: 400-411 - 1990
- [j6]Chea-Tin (Tim) Tseng, Bernard M. E. Moret
A new method for one-dimensional linear feature transformations. Pattern Recognit. 23(7): 745-752 (1990) - [c1]Chea-Tin (Tim) Tseng, Bernard M. E. Moret:
The design of a nonparametric hierarchical classifier. ICPR (1) 1990: 428-432
1980 – 1989
- 1988
- [j5]Bernard M. E. Moret:
Planar NAE3SAT is in P. SIGACT News 19(2): 51-54 (1988) - 1983
- [j4]Michael J. Mathey, Bernard M. E. Moret
The Computational Metaphor and Quantum Physics. Commun. ACM 26(2): 137-145 (1983) - [j3]Bernard M. E. Moret
Symmetric and Threshold Boolean Functions Are Exhaustive. IEEE Trans. Computers 32(12): 1211-1212 (1983) - 1982
- [j2]Bernard M. E. Moret
Decision Trees and Diagrams. ACM Comput. Surv. 14(4): 593-623 (1982) - 1980
- [j1]Bernard M. E. Moret, Michael G. Thomason, Rafael C. González:
The Activity of a Variable and Its Relation to Decision Trees. ACM Trans. Program. Lang. Syst. 2(4): 580-595 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: