Improved Algorithms for the Gene Team Tree Problem
博士 === 國立清華大學 === 資訊工程學系 === 101 === Comparing multiple genome sequences is an important method to discover new biological insights. If a group of genes remain physically close to each other in multiple genomes, often called a conserved gene cluster, then the genes may be either historically or func...
Main Authors: | Lin, Chien-Hsin, 林建欣 |
---|---|
Other Authors: | Wang, Biing-Feng |
Format: | Others |
Language: | en_US |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/00259286437266071951 |
Similar Items
-
An Experimental Study of Gene Team Problem
by: Wei-Hsin Wang, et al.
Published: (2010) -
Efficient Algorithms for Two Gene Tree Correction Problems
by: Lee, Chi Yen, et al.
Published: (2015) -
Optimal parallel algorithme for some problems on trees
by: LIN, JUN-HONG, et al.
Published: (1992) -
Improved Algorithms for Minmax Regret Path Location Problems on Trees
by: Ye, Jhih-Hong, et al.
Published: (2017) -
An Improved TRIPS Tree Mining Algorithm
by: Chien-Sheng Sher, et al.
Published: (2008)