Our project dedicated to finding microorganisms able to destruct PET plastic (having enzymes homologous to PETase and MHETase)
-
Updated
Dec 20, 2020 - HTML
#
philogenetic-trees
Here are 6 public repositories matching this topic...
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.
matlab
parallel
branch-and-bound
scoring-algorithm
exhaustive-search
fitch-scoring-algorithm
bound-search
philogenetic-trees
maximum-parsimony
-
Updated
Oct 2, 2017 - MATLAB
This pipeline automates the process of generating phylogenetic trees from sequence data, specifically designed for high-throughput and efficient analysis.
-
Updated
May 19, 2024 - Python
Genomic Analysis of Canis lupus with the use of Genomic Maps and Philogenetic Trees
-
Updated
Jun 30, 2023
Algorithm to parse, assemble and align genomic sequences by use machine learning techniques. The resulting sequences are used to form NCBI-BLAST respects and return sequence homologs.
machine-learning
bioinformatics-pipeline
biopython
de-novo-assembly
homology
philogenetic-trees
alignment-algorithm
graph-theory-algorithms
-
Updated
Mar 12, 2023 - Python
Project for the master course: Introduction to bioinformatics
-
Updated
Apr 6, 2020 - HTML
Improve this page
Add a description, image, and links to the philogenetic-trees topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the philogenetic-trees topic, visit your repo's landing page and select "manage topics."