By Topic

A New Repeat Family Detection Method Based on Sparse de Bruijn Graph

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zhou Hong ; Sch. of Comput. Sci. & Technol., Tianjin Univ., Tianjin, China ; Zhao Zheng ; Wang Hongpo

Eukaryotic genomes are typically large and filled with both genes and multiple classes of repetitive DNA. The repetitive DNAs are a rapidly evolving genome component that can provide the raw material for novel selected functions and also indicate the mechanisms and history of genome evolution in any ancestral lineage. In order to facilitate a broader range of repeat analyses, we present a graph method for repeat family detection and characterization by using the sparse de Bruijn graphs. This program was written in JAVA and with numerous adjustable parameters. Testing of this program indicated that it can found all of the major repeats.

Published in:

Knowledge Acquisition and Modeling, 2009. KAM '09. Second International Symposium on  (Volume:3 )

Date of Conference:

Nov. 30 2009-Dec. 1 2009