321 search results - page 8 / 65 » Comparison of Additive Trees Using Circular Orders |
GECCO
2004
Springer
14 years 23 days ago
2004
Springer
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
JCB
2006
13 years 7 months ago
2006
Tree structures are useful for describing and analyzing biological objects and processes. Consequently, there is a need to design metrics and algorithms to compare trees. A natura...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
d Abstract) James Allen Fill1† 1 Department of Applied Mathematics and Statistics, The Johns Hopkins University, 34th and Charles Streets, Baltimore, MD 21218-2682 USA received 2...
IJBRA
2007
13 years 7 months ago
2007
: Document clustering has been used for better document retrieval and text mining. In this paper, we investigate if a biomedical ontology improves biomedical literature clustering ...
ICNP
1996
IEEE
13 years 11 months ago
1996
IEEE
We analyze the maximum throughput that the known classes of reliable multicast protocols can attain. A new taxonomy of reliable multicast protocols is introduced based on the prem...