markov cluster
Recently Published Documents


TOTAL DOCUMENTS

8
(FIVE YEARS 2)

H-INDEX

1
(FIVE YEARS 0)

PLoS Biology ◽  
2021 ◽  
Vol 19 (8) ◽  
pp. e3001365
Author(s):  
Alexander K. Tice ◽  
David Žihala ◽  
Tomáš Pánek ◽  
Robert E. Jones ◽  
Eric D. Salomaki ◽  
...  

Phylogenomic analyses of hundreds of protein-coding genes aimed at resolving phylogenetic relationships is now a common practice. However, no software currently exists that includes tools for dataset construction and subsequent analysis with diverse validation strategies to assess robustness. Furthermore, there are no publicly available high-quality curated databases designed to assess deep (>100 million years) relationships in the tree of eukaryotes. To address these issues, we developed an easy-to-use software package, PhyloFisher (https://github.com/TheBrownLab/PhyloFisher), written in Python 3. PhyloFisher includes a manually curated database of 240 protein-coding genes from 304 eukaryotic taxa covering known eukaryotic diversity, a novel tool for ortholog selection, and utilities that will perform diverse analyses required by state-of-the-art phylogenomic investigations. Through phylogenetic reconstructions of the tree of eukaryotes and of the Saccharomycetaceae clade of budding yeasts, we demonstrate the utility of the PhyloFisher workflow and the provided starting database to address phylogenetic questions across a large range of evolutionary time points for diverse groups of organisms. We also demonstrate that undetected paralogy can remain in phylogenomic “single-copy orthogroup” datasets constructed using widely accepted methods such as all vs. all BLAST searches followed by Markov Cluster Algorithm (MCL) clustering and application of automated tree pruning algorithms. Finally, we show how the PhyloFisher workflow helps detect inadvertent paralog inclusions, allowing the user to make more informed decisions regarding orthology assignments, leading to a more accurate final dataset.


2019 ◽  
Vol 3 (1) ◽  
pp. 23
Author(s):  
Rahmat Al Kafi ◽  
Dian Maharani ◽  
Kartika Chandra Dewi ◽  
Yuni Rosita Dewi ◽  
Alhadi Bustamam

This paper presents a new approach to ameliorate the Markov Cluster algorithm for predicting figure coalition for 2019 Indonesian Presidential Election. The proposed method is the modification of the Markov Clustering algorithm. First, 20 figures are collected to form a 20 x 20 matrix. Second, the entries of the matrix are scored by 0, 1, 2, or 3 concerning the number of positive comments from netizen towards the observed figures photo on Instagram. Third, we implemented the Markov Clustering to find the clusters that represent the number of coalitions. The effectiveness of the proposed method is confirmed by comparing the prediction results with the actual coalition.


Author(s):  
Yukio HORIGUCHI ◽  
Takaya SUZUKI ◽  
Takayuki SUZUKI ◽  
Tetsuo SAWARAGI ◽  
Hiroaki NAKANISHI ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document