Cart (Loading....) | Create Account
Close category search window
 

A low-complexity probabilistic genome assembly based on hashing functions with SNP detection

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

4 Author(s)
Mounsef, N. ; Dept. of Electr. Eng., Arizona State Univ., Tempe, AZ ; Karam, L. ; Lacroix, Z. ; Legendre, C.

This paper presents an efficient low-complexity genome assembly algorithm with the ability to detect bit errors (SNPs). A hashing function is used to reduce the complexity of the assembly process. The algorithm is tested against genomic sequences of different lengths. Its performance in terms of completeness, accuracy, and efficiency (time and space) is evaluated against Phrap, a well-known sequence assembly tool. It is shown that the proposed assembly algorithm outperforms Phrap in terms of accuracy, time, and memory.

Published in:

Genomic Signal Processing and Statistics, 2008. GENSiPS 2008. IEEE International Workshop on

Date of Conference:

8-10 June 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.