Barnacle：一种基于克隆的全基因组序列组装算法
Barnacle: An Assembly Algorithm for Clone-based Sequences of Whole Genomes
摘要：
我们提出了一个组装算法{ \sc藤壶}的序列产生的克隆为基础的方法。我们通过组装人类基因组来说明我们的方法。我们的新方法放弃了原来的物理映射优先的框架。如我们所示，{ \sc Barnacle}可以更有效地解决由于重复序列而产生的冲突。后者是序列组装问题的主要难点。此外，我们能够检测到基础数据中的不一致性。我们提出并比较我们的结果在2001年12月冻结的公共工作草案的人类基因组与NCBI的大会（Build 28）。{ \sc Barnacle}生成的公共工作草案的2001年12月冻结的汇编和{ \sc Barnacle}的源代码可在（http：//www.cs.rutgers.edu/juvchoi）上获得。
英文摘要：
We propose an assembly algorithm {\sc Barnacle} for sequences generated by the clone-based approach. We illustrate our approach by assembling the human genome. Our novel method abandons the original physical-mapping-first framework. As we show, {\sc Barnacle} more effectively resolves conflicts due to repeated sequences. The latter is the main difficulty of the sequence assembly problem. Inaddition, we are able to detect inconsistencies in the underlying data. We present and compare our results on the December 2001 freeze of the public working draft of the human genome with NCBI's assembly (Build 28). The assembly of December 2001 freeze of the public working draft generated by {\sc Barnacle} and the source code of {\sc Barnacle} are available at (http://www.cs.rutgers.edu/~vchoi).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
