Documentation
¶
Overview ¶
CAMUS (Constrained Algorithm Maximizing qUartetS) is a dynamic programming algorithm for inferring level-1 phylogenetic networks from quartets and a constraint tree.
MIT License ¶
Copyright (c) 2026 James Willson ¶
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
usage: camus [flags]... <const_tree_file> <gene_tree_file>
positional arguments:
<tree_file> constraint newick tree <gene_tree_file> gene tree newick file
flags:
-f format gene tree format [newick|nexus] (default "newick") -h prints short help and exits -hh prints help with experimental features and exits -n int number of parallel processes -o string output prefix -s float collapse edges in gene trees with support less than value (default 0) -t float threshold for quartet filter [0, 1] (default 0.5) -v prints version number and exits
examples:
camus -o output-name constraint.nwk gene-trees.nwk
Directories
¶
| Path | Synopsis |
|---|---|
|
internal
|
|
|
graphs
Package containing all structs and functions related to graph-like data structures used in CAMUS such as quartets, networks, and trees
|
Package containing all structs and functions related to graph-like data structures used in CAMUS such as quartets, networks, and trees |
|
infer
Package implementing the CAMUS dynamic programming algorithm.
|
Package implementing the CAMUS dynamic programming algorithm. |
|
prep
Package used for preprocessing necessary data for the CAMUS algorithm
|
Package used for preprocessing necessary data for the CAMUS algorithm |
|
score
Package implementing scoring for networks
|
Package implementing scoring for networks |