Sequence Analysis Using Eulerian Graphs

摘要：

DNA sequence assembly programs often consist of three major steps: compare all pairs of reads, find an approximate arrangement of the significant overlaps, and multiple alignment for this arrangement. In 1976 Roger Staden used a greedy assembly version of this method. In 1995 an elegant and entirely new approach was proposed in which each read is broken down into shorter overlapping words, and then a certain graph is constructed so that Eulerian paths in this graph correspond to the target DNA sequence. In this talk I will show how this graph is constructed and give some examples of its operation including multiple alignment.

作者: Michael S.Waterman

作者单位: Biological Sciences, Mathematics, Computer Science, University of Southern California, USA

会议类型: 国际会议

会议名称: The 7th Asia-Pacific Bioinformatics Conference(第七届亚太生物信息学大会)

会议地点: 北京

会议语种:英文

页码: 5

在线出版日期: 2009-01-01（万方平台首次上网日期，不代表论文的发表时间）