SPECTRE

SPECTRE implements algorithms for constructing and analyzing planar split networks to represent complex phylogenetic relationships, including reticulate events such as hybridization and horizontal gene transfer.

Key Features:

• Data Structures and Algorithms: Provides implementations of pre-published algorithms for computing split networks, including split-decomposition, NeighborNet, QNet, and FlatNJ.
• Planar Split Network Analysis: Supports construction and analysis of planar split networks to represent non-treelike evolutionary relationships.
• Integration with Analysis Pipelines: Allows adjustment and extension of implemented approaches for incorporation into bioinformatics workflows.
• Command-line Execution for HPC: Supplies command-line interfaces for running long-running algorithms on servers and High Performance Computing environments.

Scientific Applications:

• Reticulate evolution analysis: Enables exploration of hybridization and horizontal gene transfer events using split networks.
• Phylogenetic network construction: Used when traditional tree models are insufficient to capture complex evolutionary histories.
• Large-scale phylogenetic analyses: Supports execution of computationally intensive network algorithms in server and HPC settings.
• Workflow integration: Facilitates incorporation of split-network methods into existing bioinformatics pipelines.

Methodology:

Implements computational methods explicitly including split-decomposition, NeighborNet, QNet, and FlatNJ for computing planar split networks.