%0 Journal Article
%T A RECONSTRUCTION ALGORITHM TO SOLVE POSITIONAL SEQUENCING BY HYBRIDIZATION<br>PSBH中的组合优化问题及其计算方法
%A Xiang Sun ZHANG
%A Ji Hong ZHANG
%A Ling Yun WU
%A <br>章祥荪
%A 张继红
%A 吴凌云
%J 系统科学与数学
%D 2002
%I 
%X The problem addressed in this paper is concerned with positional DNA sequencing by hybridization(i.e. PSBH). On the basis of analyzing the information provided by PSBH experiments, some criteria which can determine the most possible k-tuples at the ends of optimal reconstructions of the target DNA are obtained, and a dynamic programming method determining the most possible k-tuple in the middle of optimal reconstructions of the target DNA is also given. Prom this, a new algorithm for solving PSBH problem is proposed by us. This algorithm accepts additional errors in PSBH's spectrum resulting from the hybridization experiment and can greatly reduce ambiguities in the reconstruction of DNA sequencing. Therefore, the proposed algorithm can behave well, as shown in our computational experiments.
%K Positional sequencing by hybridization
%K positive errors
%K optimal reconstruction of the target DNA fragment
%K the adjacency matrix
%K dynamic programming<br>位置SBH杂交测序（Positional
%K Sequencing
%K by
%K Hybridization）
%K 最优解
%K 正错误
%K 目标DNA片断的最优重构
%K 联接矩阵
%K 动态规划
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=F397369A3456C59A&yid=C3ACC247184A22C1&vid=BC12EA701C895178&iid=38B194292C032A66&sid=B799C1769FCACDC8&eid=1A363081E1FF7014&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=1&reference_num=21