Search results for "supertree"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
128	Stephen J. Willson	Robustness of Topological Supertree Methods for Reconciling Dense Incompatible Data.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	Trees, Graph algorithms, phylogenetic tree, supertree
80	M. Shel Swenson, François Barbançon, C. Randal Linder, Tandy J. Warnow	A Simulation Study Comparing Supertree and Combined Analysis Methods Using SMIDGen.	WABI	2009	DBLP DOI BibTeX RDF
80	Shlomo Moran, Satish Rao, Sagi Snir	Using Semi-definite Programming to Enhance Supertree Resolvability.	WABI	2005	DBLP DOI BibTeX RDF
72	Jianrong Dong, David Fernández-Baca, Fred R. McMorris	Constructing Majority-Rule Supertrees.	WABI	2009	DBLP DOI BibTeX RDF
72	Arvind Gupta, Naomi Nishimura	finding Smallest Supertrees.	ISAAC	1995	DBLP DOI BibTeX RDF
62	Kiyoko F. Aoki-Kinoshita, Minoru Kanehisa, Ming-Yang Kao, Xiang-Yang Li 0001, Weizhao Wang	A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees.	ISAAC	2006	DBLP DOI BibTeX RDF
54	Mariana Kant, Maurice LeBon, David Sankoff	Hierarchical Clustering Using Constraints.	ISBRA	2008	DBLP DOI BibTeX RDF
54	Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, André Wehe	Heuristics for the Gene-Duplication Problem: A Theta ( n ) Speed-Up for the Local Search.	RECOMB	2007	DBLP DOI BibTeX RDF
54	Sagi Snir, Satish Rao	Using Max Cut to Enhance Rooted Trees Consistency.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	rooted triplets, semidefinite programming, Phylogenetic trees, supertrees
54	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Finding Smallest Supertrees Under Minor Containment.	WG	1999	DBLP DOI BibTeX RDF
49	Nicolas Beldiceanu, Pierre Flener, Xavier Lorca	Combining Tree Partitioning, Precedence, and Incomparability Constraints.	Constraints An Int. J.	2008	DBLP DOI BibTeX RDF	Digraph partitioning, Tree constraint, Incomparability constraint, Ordered disjoint paths problem, Phylogenetic supertree problem, Filtering, Tree, Global constraint, Precedence constraint, Hamiltonian path problem
49	Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson	Minimum-Flip Supertrees: Complexity and Algorithms.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	tree assembly, NP-completeness, Phylogenetic tree, supertree
44	Sylvain Guillemot, Vincent Berry	Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem.	CPM	2007	DBLP DOI BibTeX RDF
44	Ian P. Gent, Patrick Prosser, Barbara M. Smith, Wu Wei	Supertree Construction with Constraint Programming.	CP	2003	DBLP DOI BibTeX RDF
36	Mukul S. Bansal, Oliver Eulenstein	An Omega(n^2/ log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem.	IEEE ACM Trans. Comput. Biol. Bioinform.	2008	DBLP DOI BibTeX RDF	Algorithms, Computational Biology, Phylogenetics, Gene Duplication, Supertrees
36	Mukul S. Bansal, Oliver Eulenstein	An Omega(n2/log n) Speed-Up of TBR Heuristics for the Gene-Duplication Problem.	WABI	2007	DBLP DOI BibTeX RDF
36	Roderic D. M. Page	Modified Mincut Supertrees.	WABI	2002	DBLP DOI BibTeX RDF
36	David Bryant	Optimal Agreement Supertrees.	JOBIM	2000	DBLP DOI BibTeX RDF
36	Jean-Daniel Boissonnat, Frédéric Cazals, Julia Flötotto	2D-Structure Drawings of Similar Molecules.	GD	2000	DBLP DOI BibTeX RDF
26	Jesper Jansson 0001, Konstantinos Mampentzidis, T. P. Sandhya 0001	Building a small and informative phylogenetic supertree.	Inf. Comput.	2023	DBLP DOI BibTeX RDF
26	Aleksandr Koshkarov, Nadia Tahiri	GPTree: Generator of Phylogenetic Trees with Overlapping and Biological Events for Supertree Inference.	BIOINFORMATICS	2023	DBLP DOI BibTeX RDF
26	Erin K. Molloy	Supertree-like methods for genome-scale species tree estimation		2020	RDF
26	Renato R. O. da Silva, Jose Gustavo de Souza Paiva, Guilherme P. Telles, Carlos E. A. Zampieri, Fábio P. Rolli, Rosane Minghim	The Visual SuperTree: similarity-based multi-scale visualization.	Vis. Comput.	2019	DBLP DOI BibTeX RDF
26	Jesper Jansson 0001, Konstantinos Mampentzidis, Sandhya T. P. 0001	Building a Small and Informative Phylogenetic Supertree.	WABI	2019	DBLP DOI BibTeX RDF
26	Manuel Lafond, Cédric Chauve, Nadia El-Mabrouk, Aïda Ouangraoua	Gene Tree Construction and Correction Using SuperTree and Reconciliation.	IEEE ACM Trans. Comput. Biol. Bioinform.	2018	DBLP DOI BibTeX RDF
26	Ruth Davidson, MaLyn Lawhorn, Joseph Rusinko, Noah Weber	Efficient Quartet Representations of Trees and Applications to Supertree and Summary Methods.	IEEE ACM Trans. Comput. Biol. Bioinform.	2018	DBLP DOI BibTeX RDF
26	Diogo Telmo Neves, João Luís Sobral	Parallel SuperFine - A tool for fast and accurate supertree estimation: Features and limitations.	Future Gener. Comput. Syst.	2017	DBLP DOI BibTeX RDF
26	Jesper Jansson 0001, Wing-Kin Sung	Maximum Agreement Supertree.	Encyclopedia of Algorithms	2016	DBLP DOI BibTeX RDF
26	Manuel Lafond, Cédric Chauve, Nadia El-Mabrouk, Aïda Ouangraoua	Gene Tree Construction and Correction using SuperTree and Reconciliation.	CoRR	2016	DBLP BibTeX RDF
26	Sourya Bhattacharyya, Jayanta Mukhopadhyay	COSPEDTree-II: Improved couplet based phylogenetic supertree.	BIBM	2016	DBLP DOI BibTeX RDF
26	Sourya Bhattacharyya, Jayanta Mukherjee 0001	COSPEDTree: COuplet Supertree by Equivalence Partitioning of Taxa Set and DAG Formation.	IEEE ACM Trans. Comput. Biol. Bioinform.	2015	DBLP DOI BibTeX RDF
26	Diogo Telmo Neves, João Luís Sobral	Towards a faster and accurate supertree inference.	ISCC	2015	DBLP DOI BibTeX RDF
26	Sourya Bhattacharyya, Jayanta Mukhopadhyay	Couplet Supertree Based Species Tree Estimation.	ISBRA	2015	DBLP DOI BibTeX RDF
26	Wasiu A. Akanni, Christopher J. Creevey, Mark D. Wilkinson, Davide Pisani	L.U.St: a tool for approximated maximum likelihood supertree reconstruction.	BMC Bioinform.	2014	DBLP DOI BibTeX RDF
26	Sourya Bhattacharyya, Jayanta Mukhopadhyay	Couplet supertree by equivalence partitioning of taxa set and DAG formation.	BCB	2014	DBLP DOI BibTeX RDF
26	André Wehe, J. Gordon Burleigh, Oliver Eulenstein	Efficient Algorithms for Knowledge-Enhanced Supertree and Supermatrix Phylogenetic Problems.	IEEE ACM Trans. Comput. Biol. Bioinform.	2013	DBLP DOI BibTeX RDF
26	Malte Brinkmeyer	Polynomial supertree methods in phylogenomics : algorithms, simulations and software.		2013	RDF
26	Nam-phuong Nguyen, Siavash Mirarab, Tandy J. Warnow	MRL and SuperFine+MRL: new supertree methods.	Algorithms Mol. Biol.	2012	DBLP DOI BibTeX RDF
26	Jesper Jansson 0001, Richard S. Lemence, Andrzej Lingas	The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree.	SIAM J. Comput.	2012	DBLP DOI BibTeX RDF
26	Sevan G. Ficici, Enoch S. Liu, Gary B. Fogel	Evolutionary algorithms for supertree search.	IEEE Congress on Evolutionary Computation	2012	DBLP DOI BibTeX RDF
26	M. Shel Swenson, Rahul Suri, C. Randal Linder, Tandy J. Warnow	An experimental study of Quartets MaxCut and other supertree methods.	Algorithms Mol. Biol.	2011	DBLP DOI BibTeX RDF
26	Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker	Polynomial Supertree Methods Revisited.	Adv. Bioinformatics	2011	DBLP DOI BibTeX RDF
26	Sebastian Böcker, Quang Bao Anh Bui, François Nicolas, Anke Truß	Intractability of the Minimum-Flip Supertree problem and its variants	CoRR	2011	DBLP BibTeX RDF
26	Sebastian Böcker	Towards a Data Reduction for the Minimum Flip Supertree Problem	CoRR	2011	DBLP BibTeX RDF
26	M. Shel Swenson, François Barbançon, Tandy J. Warnow, C. Randal Linder	A simulation study comparing supertree and combined analysis methods using SMIDGen.	Algorithms Mol. Biol.	2010	DBLP DOI BibTeX RDF
26	Sylvain Guillemot, Vincent Berry	Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem.	IEEE ACM Trans. Comput. Biol. Bioinform.	2010	DBLP DOI BibTeX RDF
26	Vincent Ranwez, Alexis Criscuolo, Emmanuel J. P. Douzery	SUPERTRIPLETS: a triplet-based supertree approach to phylogenomics.	Bioinform.	2010	DBLP DOI BibTeX RDF
26	Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker	Polynomial Supertree Methods Revisited.	PRIB	2010	DBLP DOI BibTeX RDF
26	M. Shel Swenson, Rahul Suri, C. Randal Linder, Tandy J. Warnow	An Experimental Study of Quartets MaxCut and Other Supertree Methods.	WABI	2010	DBLP DOI BibTeX RDF
26	Jesper Jansson 0001, Richard S. Lemence, Andrzej Lingas	The Complexity of Inferring a Minimally Resolved Phylogenetic Supertree.	WABI	2010	DBLP DOI BibTeX RDF
26	Harris T. Lin, J. Gordon Burleigh, Oliver Eulenstein	Triplet supertree heuristics for the tree of life.	BMC Bioinform.	2009	DBLP DOI BibTeX RDF
26	Céline Scornavacca, Vincent Berry, Vincent Ranwez	From Gene Trees to Species Trees through a Supertree Approach.	LATA	2009	DBLP DOI BibTeX RDF
26	Céline Scornavacca	Supertree methods for phylogenomics. (Méthodes de superarbres pour la phylogénomique).		2009	RDF
26	Wing-Kin Sung	Maximum Agreement Supertree.	Encyclopedia of Algorithms	2008	DBLP DOI BibTeX RDF
26	Nicolas J. Tourasse, Anne-Brit Kolstø	SuperCAT: a supertree database for combined and integrative multilocus sequence typing analysis of the Bacillus cereus group of bacteria (including B. cereus, B. anthracis and B. thuringiensis).	Nucleic Acids Res.	2008	DBLP DOI BibTeX RDF
26	Philip Daniel, Charles Semple	A Class of General Supertree Methods for Nested Taxa.	SIAM J. Discret. Math.	2005	DBLP DOI BibTeX RDF
26	C. J. Creevey, James O. McInerney	Clann: investigating phylogenetic information through supertree analyses.	Bioinform.	2005	DBLP DOI BibTeX RDF
26	Charles Semple, Philip Daniel, Wim Hordijk, Roderic D. M. Page, Mike A. Steel	Supertree algorithms for ancestral divergence dates and nested taxa.	Bioinform.	2004	DBLP DOI BibTeX RDF
26	Duhong Chen, Oliver Eulenstein, David Fernández-Baca	Rainbow: a toolbox for phylogenetic supertree construction and analysis.	Bioinform.	2004	DBLP DOI BibTeX RDF
26	Joseph L. Thorley, Mark Wilkinson	A view of supertree methods.	Bioconsensus	2001	DBLP DOI BibTeX RDF
26	Olaf R. P. Bininda-Emonds	MRP supertree construction in the consensus setting.	Bioconsensus	2001	DBLP DOI BibTeX RDF
26	Duhong Chen, Lixia Diao, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson	Flipping: A supertree construction method.	Bioconsensus	2001	DBLP DOI BibTeX RDF
26	Charles Semple, Mike A. Steel	A supertree method for rooted trees.	Discret. Appl. Math.	2000	DBLP DOI BibTeX RDF
26	Atsuko Yamaguchi, Koji Nakano, Satoru Miyano	An Approximation Algorithm for the Minimum Common Supertree Problem.	Nord. J. Comput.	1997	DBLP BibTeX RDF
26	Mariana Kant	The Synthesis of Two Compatible Rooted Trees in a Rooted Supertree by an Algorithm on Sets.	ICCI	1993	DBLP BibTeX RDF
18	Mukul S. Bansal, Oliver Eulenstein, André Wehe	The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI-Based Local Searches.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	Computational phylogenetics, {tt NNI}, local search, gene-duplication, supertrees
18	David Bryant, Mike A. Steel	Computing the Distribution of a Tree Metric.	IEEE ACM Trans. Comput. Biol. Bioinform.	2009	DBLP DOI BibTeX RDF	discrete mathematics applications, Robinson-Foulds distance, Poisson approximation, trees, Biology and genetics, phylogenetics, normalization constant
18	Cédric Chauve, Nadia El-Mabrouk	New Perspectives on Gene Family Evolution: Losses in Reconciliation and a Link with Supertrees.	RECOMB	2009	DBLP DOI BibTeX RDF
18	Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson 0001	New Results on Optimizing Rooted Triplets Consistency.	ISAAC	2008	DBLP DOI BibTeX RDF
18	Mukul S. Bansal, Oliver Eulenstein	The Gene-Duplication Problem: Near-Linear Time Algorithms for NNI Based Local Searches.	ISBRA	2008	DBLP DOI BibTeX RDF
18	Tanmoy Kanti Das, Subhamoy Maitra	Analysis of the "Wavelet Tree Quantization" watermarking strategy and a modified robust scheme.	Multim. Syst.	2006	DBLP DOI BibTeX RDF	Cryptanalysis, Wavelet transform, Information security, Digital watermarking, Multimedia systems
18	Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sultana	New Constraints on Generation of Uniform Random Samples from Evolutionary Trees.	CCECE	2006	DBLP DOI BibTeX RDF
18	Barbara R. Holland, Glenn Conner, Katharina T. Huber, Vincent Moulton	Imputing Supertrees and Supernetworks from Quartets.	WABI	2006	DBLP DOI BibTeX RDF
18	Jesper Jansson 0001, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung	Rooted Maximum Agreement Supertrees.	Algorithmica	2005	DBLP DOI BibTeX RDF
18	Tetsuji Kuboyama, Kilho Shin, Tetsuhiro Miyahara, Hiroshi Yasuda	A Theoretical Analysis of Alignment and Edit Problems for Trees.	ICTCS	2005	DBLP DOI BibTeX RDF
18	Jesper Jansson 0001, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung	Rooted Maximum Agreement Supertrees.	LATIN	2004	DBLP DOI BibTeX RDF
18	Paul E. Kearney, J. Ian Munro, Derek Phillips	Efficient Generation of Uniform Samples from Phylogenetic Trees.	WABI	2003	DBLP DOI BibTeX RDF
18	Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson	Supertrees by Flipping.	COCOON	2002	DBLP DOI BibTeX RDF
18	Michael R. Fellows, Michael T. Hallett, Chantal Korostensky, Ulrike Stege	Analogs and Duals of the MAST Problem for Sequences and Trees.	ESA	1998	DBLP DOI BibTeX RDF