Openly accessible

A parallel Euler approach for large-scale biological sequence assembly

Shi, Wei and Zhou, Wanlei 2005, A parallel Euler approach for large-scale biological sequence assembly, in Third International Conference on Information Technology and Applications : 4-7 July 2005, Sydney, Australia : proceedings, IEEE Computer Society, Los Alamitos, Calif., pp. 437-441.

Attached Files
Name Description MIMEType Size Downloads
zhou-parallelEuler-2005.pdf Published version application/pdf 138.42KB 53

Title A parallel Euler approach for large-scale biological sequence assembly
Author(s) Shi, Wei
Zhou, Wanlei
Conference name International Conference on Information Technology and Applications (3rd : 2005 : Sydney, Australia)
Conference location Sydney, Australia
Conference dates 4-7 July 2005
Title of proceedings Third International Conference on Information Technology and Applications : 4-7 July 2005, Sydney, Australia : proceedings
Editor(s) He, X.
Hintz, T.
Piccardi, M.
Wu, Q.
Huang, M.
Tien, D.
Publication date 2005
Conference series International Conference on Information Technology and Applications
Start page 437
End page 441
Publisher IEEE Computer Society
Place of publication Los Alamitos, Calif.
Keyword(s) biology computing
computational complexity
genetics
parallel algorithms
sequences
Summary Biological sequence assembly is an essential step for sequencing the genomes of organisms. Sequence assembly is very computing intensive especially for the large-scale sequence assembly. Parallel computing is an effective way to reduce the computing time and support the assembly for large amount of biological fragments. Euler sequence assembly algorithm is an innovative algorithm proposed recently. The advantage of this algorithm is that its computing complexity is polynomial and it provides a better solution to the notorious “repeat” problem. This paper introduces the parallelization of the Euler sequence assembly algorithm. All the Genome fragments generated by whole genome shotgun (WGS) will be assembled as a whole rather than dividing them into groups which may incurs errors due to the inaccurate group partition. The implemented system can be run on supercomputers, network of workstations or even network of PC computers. The experimental results have demonstrated the performance of our system.
Notes This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
ISBN 0769523161
9780769523163
Language eng
Field of Research 080699 Information Systems not elsewhere classified
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2005, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30005736

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 394 Abstract Views, 53 File Downloads  -  Detailed Statistics
Created: Mon, 07 Jul 2008, 09:53:31 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.