Cargando…

Short read DNA fragment anchoring algorithm

BACKGROUND: The emerging next-generation sequencing method based on PCR technology boosts genome sequencing speed considerably, the expense is also get decreased. It has been utilized to address a broad range of bioinformatics problems. Limited by reliable output sequence length of next-generation s...

Descripción completa

Detalles Bibliográficos
Autores principales: Wang, Wendi, Zhang, Peiheng, Liu, Xinchun
Formato: Texto
Lenguaje:English
Publicado: BioMed Central 2009
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2648759/
https://www.ncbi.nlm.nih.gov/pubmed/19208116
http://dx.doi.org/10.1186/1471-2105-10-S1-S17
_version_ 1782164981535473664
author Wang, Wendi
Zhang, Peiheng
Liu, Xinchun
author_facet Wang, Wendi
Zhang, Peiheng
Liu, Xinchun
author_sort Wang, Wendi
collection PubMed
description BACKGROUND: The emerging next-generation sequencing method based on PCR technology boosts genome sequencing speed considerably, the expense is also get decreased. It has been utilized to address a broad range of bioinformatics problems. Limited by reliable output sequence length of next-generation sequencing technologies, we are confined to study gene fragments with 30~50 bps in general and it is relatively shorter than traditional gene fragment length. Anchoring gene fragments in long reference sequence is an essential and prerequisite step for further assembly and analysis works. Due to the sheer number of fragments produced by next-generation sequencing technologies and the huge size of reference sequences, anchoring would rapidly becoming a computational bottleneck. RESULTS AND DISCUSSION: We compared algorithm efficiency on BLAT, SOAP and EMBF. The efficiency is defined as the count of total output results divided by time consumed to retrieve them. The data show that our algorithm EMBF have 3~4 times efficiency advantage over SOAP, and at least 150 times over BLAT. Moreover, when the reference sequence size is increased, the efficiency of SOAP will get degraded as far as 30%, while EMBF have preferable increasing tendency. CONCLUSION: In conclusion, we deem that EMBF is more suitable for short fragment anchoring problem where result completeness and accuracy is predominant and the reference sequences are relatively large.
format Text
id pubmed-2648759
institution National Center for Biotechnology Information
language English
publishDate 2009
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-26487592009-03-03 Short read DNA fragment anchoring algorithm Wang, Wendi Zhang, Peiheng Liu, Xinchun BMC Bioinformatics Research BACKGROUND: The emerging next-generation sequencing method based on PCR technology boosts genome sequencing speed considerably, the expense is also get decreased. It has been utilized to address a broad range of bioinformatics problems. Limited by reliable output sequence length of next-generation sequencing technologies, we are confined to study gene fragments with 30~50 bps in general and it is relatively shorter than traditional gene fragment length. Anchoring gene fragments in long reference sequence is an essential and prerequisite step for further assembly and analysis works. Due to the sheer number of fragments produced by next-generation sequencing technologies and the huge size of reference sequences, anchoring would rapidly becoming a computational bottleneck. RESULTS AND DISCUSSION: We compared algorithm efficiency on BLAT, SOAP and EMBF. The efficiency is defined as the count of total output results divided by time consumed to retrieve them. The data show that our algorithm EMBF have 3~4 times efficiency advantage over SOAP, and at least 150 times over BLAT. Moreover, when the reference sequence size is increased, the efficiency of SOAP will get degraded as far as 30%, while EMBF have preferable increasing tendency. CONCLUSION: In conclusion, we deem that EMBF is more suitable for short fragment anchoring problem where result completeness and accuracy is predominant and the reference sequences are relatively large. BioMed Central 2009-01-30 /pmc/articles/PMC2648759/ /pubmed/19208116 http://dx.doi.org/10.1186/1471-2105-10-S1-S17 Text en Copyright © 2009 Wang et al; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an open access article distributed under the terms of the Creative Commons Attribution License ( (http://creativecommons.org/licenses/by/2.0) ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Research
Wang, Wendi
Zhang, Peiheng
Liu, Xinchun
Short read DNA fragment anchoring algorithm
title Short read DNA fragment anchoring algorithm
title_full Short read DNA fragment anchoring algorithm
title_fullStr Short read DNA fragment anchoring algorithm
title_full_unstemmed Short read DNA fragment anchoring algorithm
title_short Short read DNA fragment anchoring algorithm
title_sort short read dna fragment anchoring algorithm
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC2648759/
https://www.ncbi.nlm.nih.gov/pubmed/19208116
http://dx.doi.org/10.1186/1471-2105-10-S1-S17
work_keys_str_mv AT wangwendi shortreaddnafragmentanchoringalgorithm
AT zhangpeiheng shortreaddnafragmentanchoringalgorithm
AT liuxinchun shortreaddnafragmentanchoringalgorithm