Bulk Aligner: A novel sequence alignment algorithm based on graph theory and Trinity
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Junsu | - |
dc.contributor.author | Yeu, Yunku | - |
dc.contributor.author | Roh, Hongchan | - |
dc.contributor.author | Yoon, Youngmi | - |
dc.contributor.author | Park, Sanghyun | - |
dc.date.available | 2020-02-28T09:43:13Z | - |
dc.date.created | 2020-02-06 | - |
dc.date.issued | 2015-05-10 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/10532 | - |
dc.description.abstract | Sequence alignment is a widely-used tool in genomics. With the development of next generation sequencing (NGS) technology, the production of sequence read data has recently increased. A number of read alignment algorithms for handling NGS data have been developed. However, these algorithms suffer from a trade-off between the throughput and alignment quality, due to the large computational costs for processing repeat reads. Conversely, alignment algorithms with distributed systems such as Hadoop and Trinity can obtain a better throughput than existing algorithms on single machine without compromising the alignment quality. In this paper, we suggest BulkAligner, a novel sequence alignment algorithm on the graph-based in-memory distributed system Trinity. We covert the original reference sequence into graph form and perform sequence alignment by finding the longest paths on the graph. Our experimental results show that BulkAligner has at least an 1.8x and up to 57x better throughput with the same, or higher quality than existing algorithms with Hadoop. We analyze the scalability and show that we can obtain a better throughput by simply adding machines. (C) 2015 Elsevier Inc. All rights reserved. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.subject | READ ALIGNMENT | - |
dc.subject | QUALITY SCORES | - |
dc.subject | MAPREDUCE | - |
dc.subject | ULTRAFAST | - |
dc.subject | FORMAT | - |
dc.title | Bulk Aligner: A novel sequence alignment algorithm based on graph theory and Trinity | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000350705700008 | - |
dc.identifier.doi | 10.1016/j.ins.2015.01.011 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.303, pp.120 - 133 | - |
dc.identifier.scopusid | 2-s2.0-84925674981 | - |
dc.citation.endPage | 133 | - |
dc.citation.startPage | 120 | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 303 | - |
dc.contributor.affiliatedAuthor | Yoon, Youngmi | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Sequence alignment | - |
dc.subject.keywordAuthor | Distributed system | - |
dc.subject.keywordAuthor | Next generation sequencing (NGS) | - |
dc.subject.keywordAuthor | Graph-based | - |
dc.subject.keywordPlus | READ ALIGNMENT | - |
dc.subject.keywordPlus | QUALITY SCORES | - |
dc.subject.keywordPlus | MAPREDUCE | - |
dc.subject.keywordPlus | ULTRAFAST | - |
dc.subject.keywordPlus | FORMAT | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.