A greedy algorithm for linearization of partially ordered genomes using breakpoint distance
碩士 === 國立交通大學 === 生物資訊及系統生物研究所 === 98 === The total order of the genes or markers on a genome is very important for most comparative genomics studies. However, except for a few model genomes, most genomes have not been completely sequenced yet. Current genetic mapping techniques often generate gene...
Main Authors: | Huang, Cheng-Chen, 黃晟宸 |
---|---|
Other Authors: | Lu, Chin-Lung |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/23555087375094667827 |
Similar Items
-
Optimal Greedy Algorithm for Order Allocation
by: Lin,You-Ren, et al.
Published: (2018) -
The complexity of greedy algorithms on ordered graphs
by: Puricella, Antonio
Published: (2002) -
Greedy Algorithms
Published: (2008) -
A Functional Characterization of Almost Greedy and Partially Greedy Bases in Banach Spaces
by: Pablo Manuel Berná, et al.
Published: (2021-08-01) -
Generalizing Contexts Amenable to Greedy and Greedy-like Algorithms
by: Ye, Yuli
Published: (2013)