Bug#379104: ITP: complearn-mpi -- parallel quartet tree search system for clusters / supercomputers using MPI

[Rudi Cilibrasi <cilibrar@cilibrar.com>]

Package: wnpp
Severity: wishlist
Owner: Rudi Cilibrasi <cilibrar@cilibrar.com>


* Package name    : complearn-mpi
  Version         : 0.9.3
  Upstream Author : Rudi Cilibrasi <cilibrar@cilibrar.com>
* URL             : http://complearn.org/
* License         : BSD
  Programming Lang: C
  Description     : parallel quartet tree search system for clusters / supercomputers using MPI

Trying to find optimal binary trees matching a given distance matrix is
an NP-hard problem in general.  For more than 100 objects this usually
makes it infeasible to solve exactly.  In practice it can be
approximated but a quartet tree search system can require a lot of CPU
time even using sophisticated heuristics because tree scoring is slow.
This package provides a quiescent parallel manager-worker quartet tree
search system with some amount of fault tolerance using MPI.

-- System Information:
Debian Release: testing/unstable
  APT prefers testing
  APT policy: (500, 'testing'), (1, 'experimental')
Architecture: i386 (i686)
Shell:  /bin/sh linked to /bin/bash
Kernel: Linux 2.6.15-1-k7
Locale: LANG=en_US.UTF-8, LC_CTYPE=en_US.UTF-8 (charmap=UTF-8)