Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm

Long reads produced by third-generation sequencing technologies are used to construct an assembly (i.e., the subject's genome), which is further used in downstream genome analysis. Unfortunately, long reads have high sequencing error rates and a large proportion of bps in these long reads are i...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Firtina, Can, Kim, Jeremie S, Alser, Mohammed, Cali, Damla Senol, Cicek, A Ercument, Alkan, Can, Mutlu, Onur
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 07.03.2020
Subjects:
Algorithms
Alignment
Assemblies
Assembly
Dependence
Error analysis
Gene sequencing
Genomes
Markov chains
Polishes
Polishing
State of the art
Viterbi algorithm detectors
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Long reads produced by third-generation sequencing technologies are used to construct an assembly (i.e., the subject's genome), which is further used in downstream genome analysis. Unfortunately, long reads have high sequencing error rates and a large proportion of bps in these long reads are incorrectly identified. These errors propagate to the assembly and affect the accuracy of genome analysis. Assembly polishing algorithms minimize such error propagation by polishing or fixing errors in the assembly by using information from alignments between reads and the assembly (i.e., read-to-assembly alignment information). However, assembly polishing algorithms can only polish an assembly using reads either from a certain sequencing technology or from a small assembly. Such technology-dependency and assembly-size dependency require researchers to 1) run multiple polishing algorithms and 2) use small chunks of a large genome to use all available read sets and polish large genomes. We introduce Apollo, a universal assembly polishing algorithm that scales well to polish an assembly of any size (i.e., both large and small genomes) using reads from all sequencing technologies (i.e., second- and third-generation). Our goal is to provide a single algorithm that uses read sets from all available sequencing technologies to improve the accuracy of assembly polishing and that can polish large genomes. Apollo 1) models an assembly as a profile hidden Markov model (pHMM), 2) uses read-to-assembly alignment to train the pHMM with the Forward-Backward algorithm, and 3) decodes the trained model with the Viterbi algorithm to produce a polished assembly. Our experiments with real read sets demonstrate that Apollo is the only algorithm that 1) uses reads from any sequencing technology within a single run and 2) scales well to polish large assemblies without splitting the assembly into multiple parts.
AbstractList Long reads produced by third-generation sequencing technologies are used to construct an assembly (i.e., the subject's genome), which is further used in downstream genome analysis. Unfortunately, long reads have high sequencing error rates and a large proportion of bps in these long reads are incorrectly identified. These errors propagate to the assembly and affect the accuracy of genome analysis. Assembly polishing algorithms minimize such error propagation by polishing or fixing errors in the assembly by using information from alignments between reads and the assembly (i.e., read-to-assembly alignment information). However, assembly polishing algorithms can only polish an assembly using reads either from a certain sequencing technology or from a small assembly. Such technology-dependency and assembly-size dependency require researchers to 1) run multiple polishing algorithms and 2) use small chunks of a large genome to use all available read sets and polish large genomes. We introduce Apollo, a universal assembly polishing algorithm that scales well to polish an assembly of any size (i.e., both large and small genomes) using reads from all sequencing technologies (i.e., second- and third-generation). Our goal is to provide a single algorithm that uses read sets from all available sequencing technologies to improve the accuracy of assembly polishing and that can polish large genomes. Apollo 1) models an assembly as a profile hidden Markov model (pHMM), 2) uses read-to-assembly alignment to train the pHMM with the Forward-Backward algorithm, and 3) decodes the trained model with the Viterbi algorithm to produce a polished assembly. Our experiments with real read sets demonstrate that Apollo is the only algorithm that 1) uses reads from any sequencing technology within a single run and 2) scales well to polish large assemblies without splitting the assembly into multiple parts.
Author Alkan, Can
Firtina, Can
Cali, Damla Senol
Cicek, A Ercument
Mutlu, Onur
Kim, Jeremie S
Alser, Mohammed
Author_xml – sequence: 1
  givenname: Can
  surname: Firtina
  fullname: Firtina, Can
– sequence: 2
  givenname: Jeremie
  surname: Kim
  middlename: S
  fullname: Kim, Jeremie S
– sequence: 3
  givenname: Mohammed
  surname: Alser
  fullname: Alser, Mohammed
– sequence: 4
  givenname: Damla
  surname: Cali
  middlename: Senol
  fullname: Cali, Damla Senol
– sequence: 5
  givenname: A
  surname: Cicek
  middlename: Ercument
  fullname: Cicek, A Ercument
– sequence: 6
  givenname: Can
  surname: Alkan
  fullname: Alkan, Can
– sequence: 7
  givenname: Onur
  surname: Mutlu
  fullname: Mutlu, Onur
BookMark eNotj11LwzAYhYMoOOd-gHcBb9eZzzbxrgyng4HCej-T9G3XkSWz6cT9ewt6c56LA8_h3KHrEAMg9EDJQigpyZPpf7rvBdWELYjggl6hCeOcZkowdotmKR0IISwvmJR8gj7LU_Q-PuMSb-HrDMF1oc0qcPsQfWwv2TrUcIIxwjDHW2e8sR7m2IQal86dezMALlOCo_UX_BF9l_ajAZe-jX037I_36KYxPsHsn1NUrV6q5Vu2eX9dL8tNZiSjGS94DdY6yAWhUDRKaitFUTtjFXXCEa1Yw6Hh1AKppeZKy5orkjfUjr3hU_T4pz31cbyRht0hnvswLu4YLTRVhZaU_wLR91gO
ContentType Paper
Copyright 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.1902.04341
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One Community College
ProQuest Central Korea
SciTech Premium Collection
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a521-373debbce6401e7f859b547dcab81c4c0982f3ef31be0d593895d3806f1b1c4a3
IEDL.DBID BENPR
IngestDate Mon Jun 30 09:13:46 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a521-373debbce6401e7f859b547dcab81c4c0982f3ef31be0d593895d3806f1b1c4a3
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2179187951?pq-origsite=%requestingapplication%
PQID 2179187951
PQPubID 2050157
ParticipantIDs proquest_journals_2179187951
PublicationCentury 2000
PublicationDate 20200307
PublicationDateYYYYMMDD 2020-03-07
PublicationDate_xml – month: 03
  year: 2020
  text: 20200307
  day: 07
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2020
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.715866
SecondaryResourceType preprint
Snippet Long reads produced by third-generation sequencing technologies are used to construct an assembly (i.e., the subject's genome), which is further used in...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Alignment
Assemblies
Assembly
Dependence
Error analysis
Gene sequencing
Genomes
Markov chains
Polishes
Polishing
State of the art
Viterbi algorithm detectors
Title Apollo: A Sequencing-Technology-Independent, Scalable, and Accurate Assembly Polishing Algorithm
URI https://www.proquest.com/docview/2179187951
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3PT8IwFG4UNPHk7_gDSQ8eKWxrt3ZezDQQOUgW4YAnbLtOSWDgNoj-97ZjwMHEi8elyfLSl773-r2v7wPgNhaKRm5so4hggojyJOIO95BklHvEZSJWViE2QXs9Nhz6YQm4ZSWtch0Ti0AdzaTByFuOmaNplLHt-_knMqpRprtaSmjsgqqZVEYqoPrQ7oUvG5TF8aiumfGqnVkM72rx9Gu8bOo86DQtbZ_9KwgXmaVz-F-bjkA15HOVHoMdlZyA_YLRKbNT8BbMtYtndzCA_RVdWicptEXSUXcjgJs3YF-7yjyiakCeRDCQcmFGSEDTEp6KyTc0NLkCrILB5F2bkH9Mz8Cg0x48PqFSTgFxnaN1JMGREkIqT1-pFI2Z6wuX0EhywWxJpOUzJ8YqxrZQVuT6upJxI8wsL7aFXuf4HFSSWaIuAPQ55lTaPre4LggIZ5hQj3P9U99zhHAuQW29X6PySGSj7WZd_b18DQ4cc6k1RC9aA5U8XagbsCeX-ThL66WH64ak2ddfYfc5fP0B23i1SA
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LSwMxEB60KnryjW9z0JvR3SS7yQoixQcWtRTsQU81yWa1oG3tS_1R_kcn21YPgjcPngOByUxmMjNf5gPYyYyTaZSFNBVcUOFiSzXTMbVK6lhEymQuyMkmZLmsbm-Tyhh8jP7CeFjlyCfmjjptWl8jP2B-jqZnxg6PWy_Us0b57uqIQmNgFpfu_RVTts5R6RT1u8vY-Vn15IIOWQWoxlCFF4qnzhjrYswsnMxUlJhIyNRqo0IrbJAolnGX8dC4II0SDOhRylUQZ6HBdc1x23GYEGjrqgATldJ15e6rqMNiiU90Puie5rPCDnT7rd7fx7DL9gM8jvCHz88D2fnsPzuCORRdt1x7HsZcYwGmcryq7SzCfbGFBtw8JEVyMwCDYwim330CWvqi9-3ukRs0RP9FbI_oRkqK1vb8gAziG97P5umdeBBgXoojxacHlLj7-LwE1b-QaRkKjWbDrQBJNNfShokOND53hFZcyFhr3DSJmTFsFTZG6qkNL3yn9q2btd-Xt2H6onp9VbsqlS_XYYb59N1D2uQGFLrtntuESdvv1jvtraFxEaj9sS4_AcTrDzQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Apollo%3A+A+Sequencing-Technology-Independent%2C+Scalable%2C+and+Accurate+Assembly+Polishing+Algorithm&rft.jtitle=arXiv.org&rft.au=Firtina%2C+Can&rft.au=Kim%2C+Jeremie+S&rft.au=Alser%2C+Mohammed&rft.au=Cali%2C+Damla+Senol&rft.date=2020-03-07&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.1902.04341