blindAngle's library 32 articles Export Sort

Hide details

	A computationally efficient approximation to the nearest neighbor interchange metric [My Copy] Journal of Classification, Vol. 1, No. 1. (1 December 1984), pp. 93-124. by Edward K. Brown, William H. Day posted to no-tag by blindAngle on 2007-04-21 10:49:43 as
	Optimal algorithms for comparing trees with labeled leaves [My Copy] Journal of Classification, Vol. V2, No. 1. (1 December 1985), pp. 7-28. by William H. E. Day posted to no-tag by blindAngle on 2007-03-06 14:23:48 as
	Stochastic models and descriptive statistics for phylogenetic trees, from Yule to today, David J. Aldous [My Copy] posted to no-tag by blindAngle on 2006-09-12 10:05:13 as
	Geometry of the Space of Phylogenetic Trees [My Copy] Advances in Applied Mathematics, Vol. 27, No. 4. (November 2001), pp. 733-767. by Louis J. Billera, Susan P. Holmes, Karen Vogtmann posted to no-tag by blindAngle on 2006-09-12 10:04:29 as along with 1 person druvus
	A unified view on tree metrics [My Copy] (1988), pp. 85-100. by K. Ohmori, E. Tanaka posted to no-tag by blindAngle on 2006-09-12 10:04:19 as
	The Use of Tree Comparison Metrics [My Copy] Systematic Zoology, Vol. 34, No. 1. (1985), pp. 75-82. by David Penny, M. D. Hendy posted to no-tag by blindAngle on 2006-09-12 09:39:20 as along with 1 person druvus
	Distributions of Tree Comparison Metrics-Some New Results [My Copy] Systematic Biology, Vol. 42, No. 2. (1993), pp. 126-141. by Mike A. Steel, David Penny posted to no-tag by blindAngle on 2006-09-12 09:31:43 as
	Phylogenetic trees: an information visualisation perspective [My Copy] In CRPIT '04: Proceedings of the second conference on Asia-Pacific bioinformatics (2004), pp. 315-320. by Savrina F. Carrizo posted to no-tag by blindAngle on 2006-03-07 09:33:47 as
	Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms [My Copy] SIAM J. Comput., Vol. 26, No. 6. (December 1997), pp. 1656-1669. by Amihood Amir, Dmitry Keselman posted to no-tag by blindAngle on 2006-03-07 09:33:43 as
	A more efficient approximation scheme for tree alignment [My Copy] In RECOMB '97: Proceedings of the first annual international conference on Computational molecular biology (1997), pp. 310-319. by Lusheng Wang, Tao Jiang, Dan Gusfield posted to no-tag by blindAngle on 2006-03-07 09:33:41 as
	Tree compatibility and inferring evolutionary history [My Copy] In SODA '93: Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms (1993), pp. 382-391. by Tandy J. Warnow posted to no-tag by blindAngle on 2006-03-07 09:25:10 as
	Computing the quartet distance between evolutionary trees [My Copy] In SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms (2000), pp. 285-286. by David Bryant, John Tsang, Paul Kearney, Ming Li posted to no-tag by blindAngle on 2006-03-07 09:25:03 as
	On contract-and-refine transformations between phylogenetic trees [My Copy] In SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms (2004), pp. 900-909. by Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy Warnow posted to comparing trees by blindAngle on 2006-03-07 09:24:57 as
	On distances between phylogenetic trees [My Copy] In SODA '97: Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms (1997), pp. 427-436. by B. Dasgupta, X. He, T. Jiang, M. Li, J. Tromp, L. Zhang posted to no-tag by blindAngle on 2006-03-07 09:24:38 as
	Fast comparison of evolutionary trees [My Copy] In SODA '94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms (1994), pp. 481-488. by Martin Farach, Mikkel Thorup posted to no-tag by blindAngle on 2006-03-07 09:20:55 as
	TreeRank: a similarity measure for nearest neighbor searching in phylogenetic databases [My Copy] Conference on Scientific and Statistical Database Management, 2003. 15th International (2003), pp. 171-180. by J. T. L. Wang, Huiyuan Shan, D. Shasha, W. H. Piel posted to no-tag by blindAngle on 2006-03-01 09:08:49 as
	Computing unrooted maximum subtrees in sub-quartic time [My Copy] Nordic J. of Computing, Vol. 3, No. 4. (1996), pp. 295-322. by T. W. Lam, W. K. Sung, H. F. Ting posted to no-tag by blindAngle on 2006-03-01 09:08:43 as
	A Faster and Unifying Algorithm for Comparing Trees [My Copy] In COM '00: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (2000), pp. 129-142. by Ming-Yang Kao, Tak W. Lam, Wing-Kin Sung, Hing-Fung Ting posted to no-tag by blindAngle on 2006-03-01 08:59:35 as
	An even faster and more unifying algorithm for comparing trees via unbalanced bipartite matchings [My Copy] J. Algorithms, Vol. 40, No. 2. (August 2001), pp. 212-233. by Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung, Hing-Fung Ting posted to no-tag by blindAngle on 2006-03-01 08:56:11 as
	General techniques for comparing unrooted evolutionary trees [My Copy] In STOC '97: Proceedings of the twenty-ninth annual ACM symposium on Theory of computing (1997), pp. 54-65. by Ming-Yang Kao, Tak-Wah Lam, Teresa M. Przytycka, Wing-Kin Sung, Hing-Fung Ting posted to no-tag by blindAngle on 2006-03-01 08:55:25 as
	A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees [My Copy] In ESA '99: Proceedings of the 7th Annual European Symposium on Algorithms (1999), pp. 438-449. by Ming-Yang Kao, Tak W. Lam, Wing-Kin Sung, Hing-Fung Ting posted to no-tag by blindAngle on 2006-03-01 08:54:18 as
	Tree Contractions and Evolutionary Trees [My Copy] SIAM J. Comput., Vol. 27, No. 6. (December 1998), pp. 1592-1616. by Ming-Yang Kao posted to no-tag by blindAngle on 2006-03-01 08:52:20 as
	Drawing Graphs by Example Efficiently: Trees and Planar Acyclic Digraphs [My Copy] In GD '94: Proceedings of the DIMACS International Workshop on Graph Drawing (1995), pp. 404-415. by Isabel F. Cruz, Ashim Garg posted to visualization by blindAngle on 2006-02-22 12:02:55 as
	Algorithms for drawing graphs: an annotated bibliography [My Copy] Computational Geometry, Vol. 4, No. 5. (October 1994), pp. 235-282. by Giuseppe D. Battista, Peter Eades, Roberto Tamassia, Ioannis G. Tollis posted to visualization by blindAngle on 2006-02-22 12:01:44 as along with 4 people and 1 group mslima nkorf balicea csacca Semantic-Social-Networks
	Tree visualization with tree-maps: 2-d space-filling approach [My Copy] ACM Trans. Graph., Vol. 11, No. 1. (January 1992), pp. 92-99. by Ben Shneiderman posted to visualization by blindAngle on 2006-02-22 11:43:39 as along with 3 people cmoewes ajay81 seanf
	A novel algorithm and web-based tool for comparing two alternative phylogenetic trees [My Copy] Bioinformatics, Vol. 22, No. 1. (1 January 2006), pp. 117-119. by Tom M. Nye, Pietro Lio, Walter R. Gilks posted to comparing munkres trees by blindAngle on 2006-02-22 11:33:08 as along with 3 people druvus dparks aprasad
	An O(n log n) algorithm for the maximum agreement subtree problem ofr binary trees [My Copy] Siam Journal of Computing, Vol. 30, No. 5. (2 April 2000), pp. 1385-1404. by Richard Cole, Martin Farach-Colton, Ramesh Hariharan, Teresa Przytycka, Mikkel Thorup posted to agreement-subtree by blindAngle on 2006-02-22 11:30:06 as along with 1 person balicea
	Comparison of phylogenetic trees [My Copy] Mathematical Biosciences, Vol. 53, No. 1-2. (February 1981), pp. 131-147. by D. F. Robinson, L. R. Foulds posted to general-trees metric by blindAngle on 2006-02-22 11:18:59 as along with 6 people lianping calderonv druvus alexeid jmeppley balicea
	Algorithms for the Assignment and Transportation Problems [My Copy] Journal of the Society for Industrial and Applied Mathematics, Vol. 5, No. 1. (1957), pp. 32-38. by James Munkres posted to munkres by blindAngle on 2006-02-22 11:11:04 as along with 1 person ajaiswal
	Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers [My Copy] In ISAAC '00: Proceedings of the 11th International Conference on Algorithms and Computation (2000), pp. 527-538. by Wing-Kai Hon, Ming-Yang Kao, Tak W. Lam posted to nni subtree-transfers by blindAngle on 2006-02-22 11:03:01 as
	TreeJuxtaposer: scalable tree comparison using Focus+Context with guaranteed visibility [My Copy] ACM Trans. Graph., Vol. 22, No. 3. (July 2003), pp. 453-462. by Tamara Munzner, Francois Guimbretiere, Serdar Tasiran, Li Zhang, Yunhong Zhou posted to comparing trees by blindAngle on 2006-02-22 10:56:18 as along with 4 people dparks Jefficus ewerton muun
	An extension of the Munkres algorithm for the assignment problem to rectangular matrices [My Copy] Commun. ACM, Vol. 14, No. 12. (December 1971), pp. 802-804. by Fran&\#231;ois Bourgeois, Jean-Claude Lassalle posted to munkres by blindAngle on 2006-02-22 10:45:49 as along with 1 person egozi