跳到主要导航 跳到搜索 跳到主要内容

A new method for finding approximate repetitions in DNA sequences

  • Di Wang*
  • , Guoren Wang
  • , Qingquan Wu
  • , Baichen Chen
  • , Yi Zhao
  • *此作品的通讯作者
  • Northeastern University China
  • Shanghai Baosight Ltd.

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

Searching for approximate repetitions in a DNA sequence has been an important topic in gene analysis. One of the problems in the study is that because of the varying lengths of patterns, the similarity between patterns cannot be judged accurately if we use only the concept of ED (Edit Distance). In this paper we shall make effort to define a new function to compute similarity, which considers both the difference and sameness between patterns at the same time. Seeing the computational complexity, we shall also propose two new filter methods based on frequency distance and Pearson correlation, with which we can sort out candidate set of approximate repetitions efficiently. We use SUA instead of sliding window to get the fragments in a DNA sequence, so that the patterns of an approximate repetition have no limitation on length. The results show that with our technique we are able to find a bigger number of approximate repetitions than that of those found with tandem repeat finder.

源语言英语
主期刊名Advances in Web-Age Information Management - 7th International Conference, WAIM 2006, Proceedings
出版商Springer Verlag
397-409
页数13
ISBN(印刷版)3540352252, 9783540352259
DOI
出版状态已出版 - 2006
已对外发布
活动7th International Conference on Advances in Web-Age Information Management, WAIM 2006 - Hong Kong, 中国
期限: 17 6月 200619 6月 2006

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4016 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议7th International Conference on Advances in Web-Age Information Management, WAIM 2006
国家/地区中国
Hong Kong
时期17/06/0619/06/06

指纹

探究 'A new method for finding approximate repetitions in DNA sequences' 的科研主题。它们共同构成独一无二的指纹。

引用此