资 源 简 介
Note this project is being replaced. For information or the QuickQuartet code please contact Ralph Crosby @ ralphcrosby@gmail.com.
This project contains the QuickQuartet algorithm for computing the all-to-all quartet distance for large evolutionary tree collections. By leveraging the relationship between bipartitions and quartets, our approach significantly improves upon the performance of existing quartet distance algorithms. Experimental results show that QuickQuartet is up to 100 times faster than existing methods. With the availability of QuickQuartet, the use of quartet distance as a tool for analysis of evolutionary relationships becomes a practical tool for biologists to use in order to gain new insights regarding their large tree collections.
文 件 列 表
quickquartet-1.0.0
aclocal.m4
AUTHORS
BuildFlags.hh
ChangeLog
config.guess
config.hh.in
config.sub
configure
configure.in
COPYING
dag.cc
dag.hh
depcomp
docs
HashEncoder.hh
HashTable.hh
INSTALL
install-sh
lexer.cc
lexer.ll
Makefile.am
Makefile.in
missing
NEWS
numbers.hh
options.cc
options.hh
parser.cc
parser.hh
PerfBlock.hh
PerfDummy.cc
PerfLinux.cc
PerfOSX.cc
qq.cc
README
rootedtree.cc
rootedtree.hh
S.cc
S.hh
tests
UnivHashFixedVector.hh
unrootedtree-builder.cc
unrootedtree-builder.hh
unrootedtree.cc
unrootedtree.hh
ylwrap
