日本語
 
Help Privacy Policy ポリシー/免責事項
  詳細検索ブラウズ

アイテム詳細

  Recco: recombination analysis using cost optimization

Maydt, J., & Lengauer, T. (2006). Recco: recombination analysis using cost optimization. Bioinformatics, 22, 1064-1071.

Item is

基本情報

表示: 非表示:
資料種別: 学術論文

ファイル

表示: ファイル

関連URL

表示:

作成者

表示:
非表示:
 作成者:
Maydt, Jochen1, 著者           
Lengauer, Thomas1, 著者           
所属:
1Computational Biology and Applied Algorithmics, MPI for Informatics, Max Planck Society, ou_40046              

内容説明

表示:
非表示:
キーワード: -
 要旨: Motivation: Recombination plays an important role in the evolution of many pathogens, such as HIV or malaria. Despite substantial prior work, there is still a pressing need for efficient and effective methods of detecting recombination and analyzing recombinant sequences. Results: We introduce Recco, a novel fast method that, given a multiple sequence alignment, scores the cost of obtaining one of the sequences from the others by mutation and recombination. The algorithm comes with an illustrative visualization tool for locating recombination breakpoints. We analyze the sequence alignment with respect to all choices of the parameter weighting recombination cost against mutation cost. The analysis of the resulting cost curve yields additional information as to which sequence might be recombinant. On random genealogies Recco is comparable in its power of detecting recombination with the algorithm Geneconv (Sawyer, 1989). For specific relevant recombination scenarios Recco significantly outperforms Geneconv. Availability: Recco is available at http://bioinf.mpi-inf.mpg.de/recco/ Contact: jmaydt@mpi-inf.mpg.de

資料詳細

表示:
非表示:
言語: eng - English
 日付: 2007-02-212006
 出版の状態: 出版
 ページ: -
 出版情報: -
 目次: -
 査読: 査読あり
 識別子(DOI, ISBNなど): eDoc: 314608
その他: Local-ID: C125673F004B2D7B-578C261B341CEC59C125721E0048F0B9-Maydt2006
 学位: -

関連イベント

表示:

訴訟

表示:

Project information

表示:

出版物 1

表示:
非表示:
出版物名: Bioinformatics
種別: 学術雑誌
 著者・編者:
所属:
出版社, 出版地: -
ページ: - 巻号: 22 通巻号: - 開始・終了ページ: 1064 - 1071 識別子(ISBN, ISSN, DOIなど): -