Entwicklerinformationen
|
| libqsearch-dev | nondeterministic quartet tree search library for unrooted trees | Mehr ... |
qsearch is a library for universal hierarchical clustering using an arbitrary
distance matrix as input. It searches through the space of all possible
unrooted trees of a given size and finds the closest match based on a
weighted quartet cost function determined by the distance matrix. When
used in combination with other feature extraction libraries such as
libcomplearn this system can be used for fast and accurate phylogenetic
reconstruction, linguistic analysis, or stemmatology.
. |
| libqsearch-gomp-dev | CompLearn library, OpenMP version development files | Mehr ... |
qsearch is a multi-core library for hierarchical clustering.
Using this library, developers can access a tree building system for
genomics, search term clustering, language evolution, music recognition,
and much more
. |
| libqsearch-gomp1 | machine-learning core library runtime files with OpenMP (libgomp) | Mehr ... |
complearn makes artificial intelligence easy and fast on multi-core
microprocessors. By using the powerful statistical analysis already built
within data compression programs, this library delivers high-quality results
with very low effort
. |
| libqsearch1 | quartet tree search library for hierarchical clustering | Mehr ... |
Using a distance matrix as input, the qsearch library finds a tree
that fits the input data as well as possible and returns this tree
along with a confidence score for any non-degenerate distance matrix.
. |
| libqsearch1-headers | machine-learning through data compression header files | Mehr ... |
libqsearch is a library for hierarchical tree clustering. Using these
headers, developers can access a wealth of powerful and general techniques
in machine learning and pattern recognition including genomics, optical
character recognition, fuzzy matching, music recognition, and much more
. |
| qsearch-tools | qsearch machine-learning command-line utilities | Mehr ... |
The tools in this package allow the user to read text, Nexus, or
CompLearn-Binary format files and search for trees that match. The
best tree is determined using a quartet tree scoring system in the
surprisingly simple maketree command.
. |
