TREE-PUZZLE

TREE-PUZZLE reconstructs phylogenetic trees using a quartet-based maximum-likelihood approach to analyze DNA and protein sequence data.

Key Features:

• Quartet-Based Maximum-Likelihood: Employs quartet-based maximum-likelihood estimation for phylogenetic inference.
• Tree and Model Operations: Performs reconstruction, comparison, and testing of phylogenetic trees and evolutionary models from DNA and protein sequences.
• Parallelization (MPI): Implements parallelization via message-passing (MPI) to distribute computations across processors or nodes.
• Implementation: Written in ANSI C and requires a Message Passing Interface (MPI) library for parallel execution.

Scientific Applications:

• Phylogenetic reconstruction: Infers evolutionary relationships among species or genes from DNA and protein sequence data.
• Molecular evolution and comparative genomics: Supports analyses in molecular evolution, taxonomy, and comparative genomics through model testing and tree comparison.
• Large-scale genomic studies: Enables analysis of large datasets for high-throughput genomic and evolutionary studies via parallel computation.

Methodology:

Uses quartet-based maximum-likelihood estimation to reconstruct, compare, and test phylogenetic trees and evolutionary models from DNA and protein sequences; computations can be parallelized via message-passing (MPI); implemented in ANSI C.