DS-1-5 The Greedy Minimum Evolution Algorithm with an Appropriate Input Order
スポンサーリンク
概要
- 論文の詳細を見る
For the phylogeny reconstruction problem, Desper and Gascuel [6] proposed Greedy Minimum Evolution algorithm (in short, GME). This is less robust than Neighbor Joining (in short, NJ), the most famous algorithm for the phylogeny reconstruction problom, if the input distance matrix has errors. In this paper, first, we prove that GME can achieve same robustness as NJ if the input order is appropriate. Second, we contribute the randomized approach to this problem using the GME algorithm.
- 2007-03-07
著者
関連論文
- 2-E-6 無限サーバ待ち行列がつくるスケールフリー区間グラフ : クラスタ係数の評価(待ち行列(2))
- 2-B-4 無限サーバ待ち行列がつくるスケールフリー区間グラフ(待ち行列(2))
- On NK-Community Problem (Theoretical Computer Science and its Applications)
- DS-1-5 The Greedy Minimum Evolution Algorithm with an Appropriate Input Order
- DS-1-1 Robustness of Greedy Type Minimum Evolution Algorithms
- Robustness of Greedy Type Minimum Evolution Algorithms (計算理論とアルゴリズムの新展開 RIMS研究集会報告集)