Quota align: Difference between revisions
No edit summary |
No edit summary |
||
| Line 3: | Line 3: | ||
Typically in comparative genomics, we can identify anchors, chain them into syntenic blocks and interpret these blocks as derived from a common descent. However, when comparing two genomes undergone ancient genome duplications (plant genomes in particular), we have large number of blocks that are not orthologous, but are paralogous. This has forced us sometimes to use ad-hoc rules to screen these blocks. So the question is: given the expected coverage (quota) along both x- and y-axis, select a subset of the anchors with maximized total score. | Typically in comparative genomics, we can identify anchors, chain them into syntenic blocks and interpret these blocks as derived from a common descent. However, when comparing two genomes undergone ancient genome duplications (plant genomes in particular), we have large number of blocks that are not orthologous, but are paralogous. This has forced us sometimes to use ad-hoc rules to screen these blocks. So the question is: given the expected coverage (quota) along both x- and y-axis, select a subset of the anchors with maximized total score. | ||
[[Image: | [[Image:Before qa.png]][[Image:After qa.png]]<br> | ||
This program tries to screen the clusters based on the coverage constraints enforced by the user. For example, between rice-sorghum comparison, we can enforce 1:1 ratio to get all the orthologous blocks; or maybe 4:2 to grab orthologous blocks between athaliana-poplar. But the quota has to be given by the user. The program than tries to optimize the scores of these blocks globally. | This program tries to screen the clusters based on the coverage constraints enforced by the user. For example, between rice-sorghum comparison, we can enforce 1:1 ratio to get all the orthologous blocks; or maybe 4:2 to grab orthologous blocks between athaliana-poplar. But the quota has to be given by the user. The program than tries to optimize the scores of these blocks globally. | ||
To see the algorithm in action without installation, please go to [http://genomevolution.com/CoGe/SynMap.pl CoGe SynMap tool]. Select "Analysis Options", select algorithm options for "Merge Syntenic Blocks" and/or | To see the algorithm in action without installation, please go to [http://genomevolution.com/CoGe/SynMap.pl CoGe SynMap tool]. Select "Analysis Options", select algorithm options for "Merge Syntenic Blocks" and/or "Syntenic Depth". | ||
== Availability == | == Availability == | ||
The source codes are available on [http://github.com/tanghaibao/quota-alignment/ GITHUB]. Please contact haibao at berkeley dot edu for bugs/questions. | The source codes are available on [http://github.com/tanghaibao/quota-alignment/ GITHUB]. Please contact haibao at berkeley dot edu for bugs/questions. | ||
Revision as of 00:19, 9 June 2010
Introduction
Typically in comparative genomics, we can identify anchors, chain them into syntenic blocks and interpret these blocks as derived from a common descent. However, when comparing two genomes undergone ancient genome duplications (plant genomes in particular), we have large number of blocks that are not orthologous, but are paralogous. This has forced us sometimes to use ad-hoc rules to screen these blocks. So the question is: given the expected coverage (quota) along both x- and y-axis, select a subset of the anchors with maximized total score.
This program tries to screen the clusters based on the coverage constraints enforced by the user. For example, between rice-sorghum comparison, we can enforce 1:1 ratio to get all the orthologous blocks; or maybe 4:2 to grab orthologous blocks between athaliana-poplar. But the quota has to be given by the user. The program than tries to optimize the scores of these blocks globally.
To see the algorithm in action without installation, please go to CoGe SynMap tool. Select "Analysis Options", select algorithm options for "Merge Syntenic Blocks" and/or "Syntenic Depth".
Availability
The source codes are available on GITHUB. Please contact haibao at berkeley dot edu for bugs/questions.