Skip to content
/ philogenetic_trees Public

Parallel and sequential algorithms for finding philogenetic trees using Maximum Parsimony. The scoring algorithm used is Fitch scoring algorithm. Exhaustive search and Branch and Bound search algorithms are implemented in sequential variant. SPMD method is used in parallel implementation.

1 star 1 fork Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

jasnap/philogenetic_trees

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
BrB.m
BrB.m
 
 
ExhaustiveSearch.m
ExhaustiveSearch.m
 
 
FitchScoring.m
FitchScoring.m
 
 
Merge.m
Merge.m
 
 
P_BrB.m
P_BrB.m
 
 
README.md
README.md
 
 
children.m
children.m
 
 
factd.m
factd.m
 
 
fasta_rd.m
fasta_rd.m
 
 
gen_complete_tree.m
gen_complete_tree.m
 
 
get_row_count.m
get_row_count.m
 
 
get_row_odd.m
get_row_odd.m
 
 
iguanas_dump.m
iguanas_dump.m
 
 
last_tree.m
last_tree.m
 
 
lookup_table.m
lookup_table.m
 
 
non_inf_sites.m
non_inf_sites.m
 
 
nwk.m
nwk.m
 
 
parser.m
parser.m
 
 
partial_treeID.m
partial_treeID.m
 
 
primates_dump.m
primates_dump.m
 
 
test1.m
test1.m
 
 
test2.m
test2.m
 
 
test3.m
test3.m
 
 
test4.m
test4.m
 
 
test5.m
test5.m
 
 
test6.m
test6.m
 
 
treeID.m
treeID.m
 
 
treeModelGen.m
treeModelGen.m
 
 
tree_plot.m
tree_plot.m
 
 
tree_type.m
tree_type.m
 
 

Repository files navigation

philogenetic_trees

This project contains the implementation of a bioinformatics algorithm for finding phylogenetic trees using Maximum Parsimony. The scoring algorithm used is Fitch scoring algorithm.

Three types of implementations exist in this project:

  1. Exhaustive search
  2. Branch and bound search
  3. Parallel branch and bound search

The entire project is coded in MATLAB.

About

Parallel and sequential algorithms for finding philogenetic trees using Maximum Parsimony. The scoring algorithm used is Fitch scoring algorithm. Exhaustive search and Branch and Bound search algorithms are implemented in sequential variant. SPMD method is used in parallel implementation.

Topics

matlab parallel branch-and-bound scoring-algorithm exhaustive-search fitch-scoring-algorithm bound-search philogenetic-trees maximum-parsimony

Resources

Readme
Activity

Stars

1 star

Watchers

0 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy