东南大学学报（自然科学版）2011，Vol.41Issue(1)：63-66,4.DOI:10.3969/j.issn.1001-0505.2011.01.013
基于重叠信息的基因组测序短片段定位算法
Maximum use of reads overlap information for short reads mapping
摘要
Abstract
A new short reads mapping algorithm Umap is presented here. Short reads are mapped to the reference genome using the main thought of contig extension based on reads overlap information.The unique reads which match only one position in the reference genome are found at first. Then,these unique reads are extended by greedy algorithm, and finally the un-unique reads' position in the reference genome are found. The experiments show that Umap can map short reads more accurately.And up to 71％ short reads can be mapped to the reference genome. Taking advantages of the overlap information, short reads can be mapped to the reference genome more accurately.关键词
短片段/唯一子串/唯一短片段/片段重叠信息Key words
short reads/ unique k-tuple/ unique short reads/ overlap information分类
信息技术与安全科学引用本文复制引用
卢志远,谢建明,孙啸..基于重叠信息的基因组测序短片段定位算法[J].东南大学学报（自然科学版）,2011,41(1):63-66,4.基金项目
国家自然科学基金资助项目(60671018,60771024). （60671018,60771024）
