Search results for "Supertrees"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
71	Jianrong Dong, David Fernández-Baca, Fred R. McMorris	Constructing Majority-Rule Supertrees.	WABI	2009	DBLP DOI BibTeX RDF
48	Vincent Berry, François Nicolas	Maximum Agreement and Compatible Supertrees (Extended Abstract).	CPM	2004	DBLP DOI BibTeX RDF
48	David Bryant	Optimal Agreement Supertrees.	JOBIM	2000	DBLP DOI BibTeX RDF
48	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Finding Smallest Supertrees Under Minor Containment.	WG	1999	DBLP DOI BibTeX RDF
48	Arvind Gupta, Naomi Nishimura	finding Smallest Supertrees.	ISAAC	1995	DBLP DOI BibTeX RDF
45	Stefan Grünewald, Andreas Spillner 0001, Kristoffer Forslund, Vincent Moulton	Constructing Phylogenetic Supernetworks from Quartets.	WABI	2008	DBLP DOI BibTeX RDF
31	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
31	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
31	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
26	Feng Fu, Bo Deng, Liming Dai	The Chromatic Entropy of Linear Supertrees and Its Application.	Symmetry	2023	DBLP DOI BibTeX RDF
26	Vladimir Makarenkov, Gayane S. Barseghyan, Nadia Tahiri	Inferring multiple consensus trees and supertrees using clustering: a review.	CoRR	2023	DBLP DOI BibTeX RDF
26	Nadia Tahiri, Bernard Fichet, Vladimir Makarenkov	Building alternative consensus trees and supertrees using k-means and Robinson and Foulds distance.	Bioinform.	2022	DBLP DOI BibTeX RDF
26	Wen-Huan Wang, Jin-Xiu Zhou, Rui Sun	On the conjecture of the r-uniform supertrees with the eight largest α-spectral radii.	Discret. Appl. Math.	2022	DBLP DOI BibTeX RDF
26	Xilin Yu, Thien Le, Sarah A. Christensen, Erin K. Molloy, Tandy J. Warnow	Using Robinson-Foulds supertrees in divide-and-conquer phylogeny estimation.	Algorithms Mol. Biol.	2021	DBLP DOI BibTeX RDF
26	Colin Defant, Noah Kravitz, Ashwin Sah	Supertrees.	Electron. J. Comb.	2020	DBLP DOI BibTeX RDF
26	Lihua You, Lihong Deng, Yufei Huang	The maximum α-spectral radius and the majorization theorem of k-uniform supertrees.	Discret. Appl. Math.	2020	DBLP DOI BibTeX RDF
26	Xilin Yu, Thien Le, Sarah A. Christensen, Erin K. Molloy, Tandy J. Warnow	Advancing Divide-And-Conquer Phylogeny Estimation Using Robinson-Foulds Supertrees.	WABI	2020	DBLP DOI BibTeX RDF
26	Li Su, Liying Kang, Honghai Li, Erfang Shan	The Matching Polynomials and Spectral Radii of Uniform Supertrees.	Electron. J. Comb.	2018	DBLP DOI BibTeX RDF
26	Pranjal Vachaspati, Tandy J. Warnow	FastRFS: fast and accurate Robinson-Foulds Supertrees using constrained exact optimization.	Bioinform.	2017	DBLP DOI BibTeX RDF
26	Honghai Li, Jia-Yu Shao, Liqun Qi 0001	The extremal spectral radii of k -uniform supertrees.	J. Comb. Optim.	2016	DBLP DOI BibTeX RDF
26	Jesper Jansson 0001, Wing-Kin Sung	Minimal Phylogenetic Supertrees and Local Consensus Trees.	MFCS	2016	DBLP DOI BibTeX RDF
26	Alexander Grigoriev, Steven Kelk, Nela Lekic	On Low Treewidth Graphs and Supertrees.	J. Graph Algorithms Appl.	2015	DBLP DOI BibTeX RDF
26	Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä	Optimizing Phylogenetic Supertrees Using Answer Set Programming.	CoRR	2015	DBLP BibTeX RDF
26	Laura Koponen, Emilia Oikarinen, Tomi Janhunen, Laura Säilä	Optimizing phylogenetic supertrees using answer set programming.	Theory Pract. Log. Program.	2015	DBLP DOI BibTeX RDF
26	David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati	Fixed-Parameter Algorithms for Finding Agreement Supertrees.	SIAM J. Comput.	2015	DBLP DOI BibTeX RDF
26	Alexander Grigoriev, Steven Kelk, Nela Lekic	On low treewidth graphs and supertrees.	CoRR	2014	DBLP BibTeX RDF
26	Alexander Grigoriev, Steven Kelk, Nela Lekic	On Low Treewidth Graphs and Supertrees.	AlCoB	2014	DBLP DOI BibTeX RDF
26	Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker	FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time.	Algorithmica	2013	DBLP DOI BibTeX RDF
26	Ruchi Chaudhary, J. Gordon Burleigh, David Fernández-Baca	Fast Local Search for Unrooted Robinson-Foulds Supertrees.	IEEE ACM Trans. Comput. Biol. Bioinform.	2012	DBLP DOI BibTeX RDF
26	David Fernández-Baca, Sylvain Guillemot, Brad Shutters, Sudheer Vakati	Fixed-Parameter Algorithms for Finding Agreement Supertrees.	CPM	2012	DBLP DOI BibTeX RDF
26	André Wehe, J. Gordon Burleigh, Oliver Eulenstein	Algorithms for Knowledge-Enhanced Supertrees.	ISBRA	2012	DBLP DOI BibTeX RDF
26	Pawel Górecki 0001, J. Gordon Burleigh, Oliver Eulenstein	GTP Supertrees from Unrooted Gene Trees: Linear Time Algorithms for NNI Based Local Searches.	ISBRA	2012	DBLP DOI BibTeX RDF
26	Viet Tung Hoang, Wing-Kin Sung	Improved Algorithms for Maximum Agreement and Compatible Supertrees.	Algorithmica	2011	DBLP DOI BibTeX RDF
26	Ruchi Chaudhary, J. Gordon Burleigh, David Fernández-Baca	Fast Local Search for Unrooted Robinson-Foulds Supertrees.	ISBRA	2011	DBLP DOI BibTeX RDF
26	Jianrong Dong, David Fernández-Baca	Constructing Large Conservative Supertrees.	WABI	2011	DBLP DOI BibTeX RDF
26	Malte Brinkmeyer, Thasso Griebel, Sebastian Böcker	FlipCut Supertrees: Towards Matrix Representation Accuracy in Polynomial Time.	COCOON	2011	DBLP DOI BibTeX RDF
26	Jianrong Dong, David Fernández-Baca, Fred R. McMorris	Constructing majority-rule supertrees.	Algorithms Mol. Biol.	2010	DBLP DOI BibTeX RDF
26	Mukul S. Bansal, J. Gordon Burleigh, Oliver Eulenstein, David Fernández-Baca	Robinson-Foulds Supertrees.	Algorithms Mol. Biol.	2010	DBLP DOI BibTeX RDF
26	Max Homilius, John Gordon Burleigh, Oliver Eulenstein	Triplet-Supertrees constructed from Minimum Triplet Presentations.	BICoB	2010	DBLP BibTeX RDF
26		Computing Rooted and Unrooted Maximum Consistent Supertrees	CoRR	2009	DBLP BibTeX RDF
26	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
26	Céline Scornavacca, Vincent Berry, Vincent Lefort, Emmanuel J. P. Douzery, Vincent Ranwez	PhySIC_IST: cleaning source trees to infer more informative supertrees.	BMC Bioinform.	2008	DBLP DOI BibTeX RDF
26	Viet Tung Hoang, Wing-Kin Sung	Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees	CoRR	2008	DBLP BibTeX RDF
26	Vincent Berry	On building and comparing trees Application to supertrees in phylogenetics.		2008	RDF
26	Jeroen De Knijf	Mining Tree Patterns with Almost Smallest Supertrees.	SDM	2008	DBLP DOI BibTeX RDF
26	Viet Tung Hoang, Wing-Kin Sung	Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees.	STACS	2008	DBLP DOI BibTeX RDF
26	Vincent Berry, François Nicolas	Maximum agreement and compatible supertrees.	J. Discrete Algorithms	2007	DBLP DOI BibTeX RDF
26	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
26	Francesc Rosselló, Gabriel Valiente	An algebraic view of the relation between largest common subtrees and smallest common supertrees.	Theor. Comput. Sci.	2006	DBLP DOI BibTeX RDF
26	Francesc Rosselló, Gabriel Valiente	An Algebraic View of the Relation between Largest Common Subtrees and Smallest Common Supertrees	CoRR	2006	DBLP BibTeX RDF
26	Barbara R. Holland, Glenn Conner, Katharina T. Huber, Vincent Moulton	Imputing Supertrees and Supernetworks from Quartets.	WABI	2006	DBLP DOI BibTeX RDF
26	Jesper Jansson 0001, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung	Rooted Maximum Agreement Supertrees.	Algorithmica	2005	DBLP DOI BibTeX RDF
26	Jesper Jansson 0001, Joseph H.-K. Ng, Kunihiko Sadakane, Wing-Kin Sung	Rooted Maximum Agreement Supertrees.	LATIN	2004	DBLP DOI BibTeX RDF
26	Mercè Llabrés, Francesc Rosselló, Gabriel Valiente	On Supertrees of Phylogenetic Trees.	Spanish Bioinformatics Conference	2004	DBLP BibTeX RDF
26	Sebastian Böcker	Exponentially many supertrees.	Appl. Math. Lett.	2002	DBLP DOI BibTeX RDF
26	Roderic D. M. Page	Modified Mincut Supertrees.	WABI	2002	DBLP DOI BibTeX RDF
26	Duhong Chen, Oliver Eulenstein, David Fernández-Baca, Michael J. Sanderson	Supertrees by Flipping.	COCOON	2002	DBLP DOI BibTeX RDF
26	Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thilikos	Finding Smallest Supertrees Under Minor Containment.	Int. J. Found. Comput. Sci.	2000	DBLP DOI BibTeX RDF
26	Arvind Gupta, Naomi Nishimura	Finding Largest Subtrees and Smallest Supertrees.	Algorithmica	1998	DBLP DOI BibTeX RDF
23	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
23	Peixiang Zhao 0002, Jeffrey Xu Yu	Mining Closed Frequent Free Trees in Graph Databases.	DASFAA	2007	DBLP DOI BibTeX RDF
23	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
23	Vincent Berry, François Nicolas	Improved Parameterized Complexity of the Maximum Agreement Subtree and Maximum Compatible Tree Problems.	IEEE ACM Trans. Comput. Biol. Bioinform.	2006	DBLP DOI BibTeX RDF	algorithms, pattern matching, trees, consensus, compatibility, fixed-parameter tractability, Phylogenetics