Introducing difference recurrence relations for faster semi-global alignment of long sequences
Background The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the S...
Gespeichert in:
| Veröffentlicht in: | BMC bioinformatics Jg. 19; H. Suppl 1; S. 45 - 47 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
London
BioMed Central
19.02.2018
BioMed Central Ltd BMC |
| Schlagworte: | |
| ISSN: | 1471-2105, 1471-2105 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Background
The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith–Waterman–Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors.
Results
We proposed a faster semi-global alignment algorithm, “difference recurrence relations,” that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs.
Conclusions
Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at
https://github.com/ocxtal/libgaba
. |
|---|---|
| AbstractList | The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. We proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba. Background The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. Results We proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Conclusions Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at Keywords: Sequence analysis, Alignment, Long read Abstract Background The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith–Waterman–Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. Results We proposed a faster semi-global alignment algorithm, “difference recurrence relations,” that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Conclusions Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba. The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors.BACKGROUNDThe read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors.We proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs.RESULTSWe proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs.Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba .CONCLUSIONSOur novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba . The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith-Waterman-Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. We proposed a faster semi-global alignment algorithm, "difference recurrence relations," that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba . Background The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take advantage of single-instruction multiple-data (SIMD) operations to accelerate calculation of dynamic programming (DP) matrices in the Smith–Waterman–Gotoh (SWG) algorithm with a fixed alignment start position at the origin. Nonetheless, 16-bit or 32-bit integers are necessary for storing the values in a DP matrix when sequences to be aligned are long; this situation hampers the use of the full SIMD width of modern processors. Results We proposed a faster semi-global alignment algorithm, “difference recurrence relations,” that runs more rapidly than the state-of-the-art algorithm by a factor of 2.1. Instead of calculating and storing all the values in a DP matrix directly, our algorithm computes and stores mainly the differences between the values of adjacent cells in the matrix. Although the SWG algorithm and our algorithm can output exactly the same result, our algorithm mainly involves 8-bit integer operations, enabling us to exploit the full width of SIMD operations (e.g., 32) on modern processors. We also developed a library, libgaba, so that developers can easily integrate our algorithm into alignment programs. Conclusions Our novel algorithm and optimized library implementation will facilitate accelerating nucleotide long-read analysis algorithms that use pairwise alignment stages. The library is implemented in the C programming language and available at https://github.com/ocxtal/libgaba . |
| ArticleNumber | 45 |
| Audience | Academic |
| Author | Kasahara, Masahiro Suzuki, Hajime |
| Author_xml | – sequence: 1 givenname: Hajime surname: Suzuki fullname: Suzuki, Hajime organization: Department of Computational Biology and Medical Sciences, Graduate School of Frontier Sciences, the University of Tokyo – sequence: 2 givenname: Masahiro surname: Kasahara fullname: Kasahara, Masahiro email: mkasa@k.u-tokyo.ac.jp organization: Department of Computational Biology and Medical Sciences, Graduate School of Frontier Sciences, the University of Tokyo |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/29504909$$D View this record in MEDLINE/PubMed |
| BookMark | eNp9Ustu1TAUjFARfcAHsEGR2MAixXacxN4gVVWBK1VC4rHFOnHs4Ctfu9gJgr_vSdNWvQhVXvg1Mz7jM8fFQYjBFMVLSk4pFe27TJloZEWoqBihvBJPiiPKO1oxSpqDB-vD4jjnLSG0E6R5Vhwy2RAuiTwqfmzClOIwaxfGcnDWmmSCNmUyek53Sw-TiyGXNqbSQp5MKrPZuWr0sQdfgndj2JkwldGWPqJQNr_mhZufF08t-Gxe3M4nxfcPF9_OP1WXnz9uzs8uK912zVRpYWsrGzZYoLTtB2Baih5YazuQomuY7CTvpZStxR2QnlvTsV5SZvqhBlGfFJtVd4iwVVfJ7SD9VRGcujmIaVSQJqe9UaSDllNKawvAe95DI9uGt5ITNA-MoNb7Vetq7ndm0Ggsgd8T3b8J7qca42_ViLoVNUOBN7cCKeI_5EntXNbGewgmzllhr4jgVAqK0NcrdAQszQUbUVEvcHWGRRHBunap6PQ_KBwDdkFjJqzD8z3C2z0CYibzZxphzlltvn7Zx756aPfe511GEEBXgE4x52TsPYQSteRQrTlUmMPFG1dLP7p_ONpNNynCyp1_lMlWZsZXwmiS2sY5BQzPI6Rr80_wpw |
| CitedBy_id | crossref_primary_10_1186_s13059_020_02168_z crossref_primary_10_3389_fgene_2021_731515 crossref_primary_10_1038_s41598_019_40739_8 crossref_primary_10_1016_j_compbiolchem_2022_107735 crossref_primary_10_1101_gr_277637_122 crossref_primary_10_1101_gr_279858_124 crossref_primary_10_1109_ACCESS_2024_3520669 crossref_primary_10_1186_s12864_020_6569_1 crossref_primary_10_1038_s43588_022_00201_8 crossref_primary_10_1089_cmb_2021_0445 crossref_primary_10_1016_j_future_2024_03_050 crossref_primary_10_1186_s13059_020_02151_8 crossref_primary_10_1093_gigascience_giaf007 crossref_primary_10_1186_s12859_021_04162_z crossref_primary_10_1089_cmb_2020_0603 crossref_primary_10_1128_mra_00403_24 crossref_primary_10_1145_3360551 crossref_primary_10_1007_s12539_021_00473_0 crossref_primary_10_1093_bib_bbae473 crossref_primary_10_1186_s13059_023_02972_3 crossref_primary_10_1016_j_tplants_2023_08_013 crossref_primary_10_1080_13102818_2021_1892522 crossref_primary_10_1186_s12859_020_03697_x crossref_primary_10_1109_TCBB_2023_3264514 crossref_primary_10_1093_genetics_iyab074 crossref_primary_10_3389_fcell_2021_731424 crossref_primary_10_1038_s41592_022_01457_8 crossref_primary_10_1038_s43588_023_00496_1 crossref_primary_10_1186_s13059_022_02610_4 crossref_primary_10_1128_mra_00083_24 crossref_primary_10_1089_cmb_2021_0290 crossref_primary_10_1093_gpbjnl_qzae025 crossref_primary_10_3390_app13074385 crossref_primary_10_1038_s41467_023_41262_1 crossref_primary_10_1109_TC_2022_3144115 crossref_primary_10_1093_bioadv_vbaf173 |
| Cites_doi | 10.1101/128835 10.1016/S0022-2836(05)80360-2 10.1016/S0020-0190(01)00182-X 10.1093/bioinformatics/btu507 10.1142/S0219720012500023 10.1109/ICCABS.2016.7802776 10.1093/bioinformatics/btw753 10.1186/s12859-016-0930-z 10.1016/0020-0190(86)90091-8 10.1101/gr.809403 10.1016/0022-2836(82)90398-9 10.1186/1471-2105-13-238 10.1101/031500 10.1145/316542.316550 10.1038/nmeth.1923 10.1038/ncomms11307 10.1186/1471-2105-9-11 10.1093/nar/gkw1076 10.1101/130633 10.1101/gr.214007.116 10.1093/bioinformatics/16.8.699 10.1093/nar/gkr367 10.1093/bioinformatics/btp324 10.1093/bioinformatics/bty191 10.1038/nbt.2280 10.1016/0022-2836(81)90087-5 10.1093/bioinformatics/btl582 10.1101/gr.113985.110 10.1186/1471-2105-10-421 10.1038/nbt.3238 10.1371/journal.pone.0082138 10.1186/1471-2105-15-180 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2018 COPYRIGHT 2018 BioMed Central Ltd. |
| Copyright_xml | – notice: The Author(s) 2018 – notice: COPYRIGHT 2018 BioMed Central Ltd. |
| DBID | C6C AAYXX CITATION CGR CUY CVF ECM EIF NPM ISR 7X8 5PM DOA |
| DOI | 10.1186/s12859-018-2014-8 |
| DatabaseName | Springer Nature OA Free Journals CrossRef Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed Gale In Context: Science MEDLINE - Academic PubMed Central (Full Participant titles) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic MEDLINE |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Open Access Full Text url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Biology |
| EISSN | 1471-2105 |
| EndPage | 47 |
| ExternalDocumentID | oai_doaj_org_article_07a641113faa4b4ba596546940ffea20 PMC5836832 A546082760 29504909 10_1186_s12859_018_2014_8 |
| Genre | Research Support, Non-U.S. Gov't Journal Article |
| GroupedDBID | --- 0R~ 23N 2WC 53G 5VS 6J9 7X7 88E 8AO 8FE 8FG 8FH 8FI 8FJ AAFWJ AAJSJ AAKPC AASML ABDBF ABUWG ACGFO ACGFS ACIHN ACIWK ACPRK ACUHS ADBBV ADMLS ADRAZ ADUKV AEAQA AENEX AEUYN AFKRA AFPKN AFRAH AHBYD AHMBA AHYZX ALMA_UNASSIGNED_HOLDINGS AMKLP AMTXH AOIJS ARAPS AZQEC BAPOH BAWUL BBNVY BCNDV BENPR BFQNJ BGLVJ BHPHI BMC BPHCQ BVXVI C6C CCPQU CS3 DIK DU5 DWQXO E3Z EAD EAP EAS EBD EBLON EBS EJD EMB EMK EMOBN ESX F5P FYUFA GNUQQ GROUPED_DOAJ GX1 H13 HCIFZ HMCUK HYE IAO ICD IHR INH INR ISR ITC K6V K7- KQ8 LK8 M1P M48 M7P MK~ ML0 M~E O5R O5S OK1 OVT P2P P62 PGMZT PHGZM PHGZT PIMPY PJZUB PPXIY PQGLB PQQKQ PROAC PSQYO PUEGO RBZ RNS ROL RPM RSV SBL SOJ SV3 TR2 TUS UKHRP W2D WOQ WOW XH6 XSB AAYXX AFFHD CITATION ALIPV CGR CUY CVF ECM EIF NPM 7X8 5PM |
| ID | FETCH-LOGICAL-c675t-c8f3f952dfa116bda2c98ba26f7a987529794b9996f875a0b4fe72b912ebd3a83 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 81 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000425991900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1471-2105 |
| IngestDate | Fri Oct 03 12:34:23 EDT 2025 Tue Nov 04 02:04:59 EST 2025 Thu Sep 04 20:27:25 EDT 2025 Tue Nov 11 10:27:43 EST 2025 Tue Nov 04 17:24:44 EST 2025 Thu Nov 13 14:29:19 EST 2025 Mon Jul 21 05:25:44 EDT 2025 Sat Nov 29 05:40:02 EST 2025 Tue Nov 18 22:53:30 EST 2025 Sat Sep 06 07:27:16 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | Suppl 1 |
| Keywords | Sequence analysis Alignment Long read |
| Language | English |
| License | Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c675t-c8f3f952dfa116bda2c98ba26f7a987529794b9996f875a0b4fe72b912ebd3a83 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| OpenAccessLink | https://doaj.org/article/07a641113faa4b4ba596546940ffea20 |
| PMID | 29504909 |
| PQID | 2010841981 |
| PQPubID | 23479 |
| PageCount | 15 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_07a641113faa4b4ba596546940ffea20 pubmedcentral_primary_oai_pubmedcentral_nih_gov_5836832 proquest_miscellaneous_2010841981 gale_infotracmisc_A546082760 gale_infotracacademiconefile_A546082760 gale_incontextgauss_ISR_A546082760 pubmed_primary_29504909 crossref_primary_10_1186_s12859_018_2014_8 crossref_citationtrail_10_1186_s12859_018_2014_8 springer_journals_10_1186_s12859_018_2014_8 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-02-19 |
| PublicationDateYYYYMMDD | 2018-02-19 |
| PublicationDate_xml | – month: 02 year: 2018 text: 2018-02-19 day: 19 |
| PublicationDecade | 2010 |
| PublicationPlace | London |
| PublicationPlace_xml | – name: London – name: England |
| PublicationSubtitle | BMC series – open, inclusive and trusted |
| PublicationTitle | BMC bioinformatics |
| PublicationTitleAbbrev | BMC Bioinformatics |
| PublicationTitleAlternate | BMC Bioinformatics |
| PublicationYear | 2018 |
| Publisher | BioMed Central BioMed Central Ltd BMC |
| Publisher_xml | – name: BioMed Central – name: BioMed Central Ltd – name: BMC |
| References | K Kimura (2014_CR33) 2012; 10 2014_CR8 M Crochemore (2014_CR30) 2001; 80 2014_CR1 K Berlin (2014_CR6) 2015; 33 A Döring (2014_CR37) 2008; 9 AC English (2014_CR3) 2014; 15 MJ Chaisson (2014_CR10) 2012; 13 C Camacho (2014_CR34) 2009; 10 2014_CR38 KM Chao (2014_CR16) 1992; 8 S Schwartz (2014_CR15) 2003; 13 2014_CR32 2014_CR35 SM Kiełbasa (2014_CR9) 2011; 21 RD Finn (2014_CR22) 2011; 39 M Šošić (2014_CR36) 2017; 33 G Myers (2014_CR26) 1999; 46 TF Smith (2014_CR13) 1981; 147 SF Altschul (2014_CR7) 1990; 215 I Sović (2014_CR12) 2016; 7 O Gotoh (2014_CR14) 1982; 162 J Daily (2014_CR24) 2016; 17 S Koren (2014_CR5) 2012; 30 T Rognes (2014_CR18) 2000; 16 L Allison (2014_CR29) 1986; 23 A Wozniak (2014_CR17) 1997; 13 J Loving (2014_CR31) 2014; 30 B Langmead (2014_CR21) 2012; 9 2014_CR25 2014_CR28 H Hyyrö (2014_CR27) 2004 M Farrar (2014_CR19) 2007; 23 B Deonovic (2014_CR2) 2017; 45 J Huddleston (2014_CR4) 2017; 27 G Myers (2014_CR11) 2014 M Zhao (2014_CR23) 2013; 8 H Li (2014_CR20) 2009; 25 |
| References_xml | – ident: 2014_CR1 doi: 10.1101/128835 – volume: 215 start-page: 403 issue: 3 year: 1990 ident: 2014_CR7 publication-title: J Mol Biol doi: 10.1016/S0022-2836(05)80360-2 – volume: 80 start-page: 279 issue: 6 year: 2001 ident: 2014_CR30 publication-title: Inf Process Lett doi: 10.1016/S0020-0190(01)00182-X – volume-title: 15th Australasian Workshop on Combinatorial Algorithms (AWOCA 2004) year: 2004 ident: 2014_CR27 – volume: 30 start-page: 3166 issue: 22 year: 2014 ident: 2014_CR31 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btu507 – volume: 10 start-page: 1250002 issue: 04 year: 2012 ident: 2014_CR33 publication-title: J Bioinforma Comput Biol doi: 10.1142/S0219720012500023 – ident: 2014_CR35 doi: 10.1109/ICCABS.2016.7802776 – volume: 33 start-page: 1394 issue: 9 year: 2017 ident: 2014_CR36 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btw753 – volume: 17 start-page: 81 issue: 1 year: 2016 ident: 2014_CR24 publication-title: BMC Bioinformatics doi: 10.1186/s12859-016-0930-z – volume: 23 start-page: 305 issue: 5 year: 1986 ident: 2014_CR29 publication-title: Inf Process Lett doi: 10.1016/0020-0190(86)90091-8 – volume: 13 start-page: 103 issue: 1 year: 2003 ident: 2014_CR15 publication-title: Genome Res doi: 10.1101/gr.809403 – volume: 13 start-page: 145 issue: 2 year: 1997 ident: 2014_CR17 publication-title: Comput Appl Biosci: CABIOS – volume: 162 start-page: 705 issue: 3 year: 1982 ident: 2014_CR14 publication-title: J Mol Biol doi: 10.1016/0022-2836(82)90398-9 – volume: 13 start-page: 238 issue: 1 year: 2012 ident: 2014_CR10 publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-13-238 – ident: 2014_CR28 doi: 10.1101/031500 – volume: 46 start-page: 395 issue: 3 year: 1999 ident: 2014_CR26 publication-title: J ACM (JACM) doi: 10.1145/316542.316550 – volume: 9 start-page: 357 issue: 4 year: 2012 ident: 2014_CR21 publication-title: Nat Methods doi: 10.1038/nmeth.1923 – volume: 7 start-page: 11307 year: 2016 ident: 2014_CR12 publication-title: Nat Commun doi: 10.1038/ncomms11307 – volume: 8 start-page: 481 issue: 5 year: 1992 ident: 2014_CR16 publication-title: Comput Appl Biosci: CABIOS – volume: 9 start-page: 11 issue: 1 year: 2008 ident: 2014_CR37 publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-9-11 – volume: 45 start-page: 32 issue: 5 year: 2017 ident: 2014_CR2 publication-title: Nucleic Acids Res doi: 10.1093/nar/gkw1076 – ident: 2014_CR25 doi: 10.1101/130633 – volume: 27 start-page: 677 issue: 5 year: 2017 ident: 2014_CR4 publication-title: Genome Res doi: 10.1101/gr.214007.116 – volume: 16 start-page: 699 issue: 8 year: 2000 ident: 2014_CR18 publication-title: Bioinformatics doi: 10.1093/bioinformatics/16.8.699 – volume: 39 start-page: 29 issue: Web Server issu year: 2011 ident: 2014_CR22 publication-title: Nucleic Acids Res doi: 10.1093/nar/gkr367 – volume: 25 start-page: 1754 issue: 14 year: 2009 ident: 2014_CR20 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btp324 – ident: 2014_CR38 doi: 10.1093/bioinformatics/bty191 – volume: 30 start-page: 693 issue: 7 year: 2012 ident: 2014_CR5 publication-title: Nat Biotechnol doi: 10.1038/nbt.2280 – volume: 147 start-page: 195 issue: 1 year: 1981 ident: 2014_CR13 publication-title: J Mol Biol doi: 10.1016/0022-2836(81)90087-5 – ident: 2014_CR8 – volume-title: Algorithms in Bioinformatics year: 2014 ident: 2014_CR11 – volume: 23 start-page: 156 issue: 2 year: 2007 ident: 2014_CR19 publication-title: Bioinformatics doi: 10.1093/bioinformatics/btl582 – volume: 21 start-page: 487 issue: 3 year: 2011 ident: 2014_CR9 publication-title: Genome Res doi: 10.1101/gr.113985.110 – volume: 10 start-page: 421 issue: 1 year: 2009 ident: 2014_CR34 publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-10-421 – volume: 33 start-page: 623 issue: 6 year: 2015 ident: 2014_CR6 publication-title: Nat Biotechnol doi: 10.1038/nbt.3238 – ident: 2014_CR32 – volume: 8 start-page: e82138 issue: 12 year: 2013 ident: 2014_CR23 publication-title: PLOS ONE doi: 10.1371/journal.pone.0082138 – volume: 15 start-page: 180 issue: 1 year: 2014 ident: 2014_CR3 publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-15-180 |
| SSID | ssj0017805 |
| Score | 2.5658967 |
| Snippet | Background
The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often... The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often take... Background The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long reads often... Abstract Background The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular alignment software tools widely used for analyzing such long... |
| SourceID | doaj pubmedcentral proquest gale pubmed crossref springer |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 45 |
| SubjectTerms | Algorithms Alignment Base sequence Bioinformatics Biomedical and Life Sciences Computational Biology/Bioinformatics Computer Appl. in Life Sciences Humans Life Sciences Long read Methodology Microarrays Sequence Alignment - methods Sequence analysis Sequence Analysis, DNA - methods Software |
| SummonAdditionalLinks | – databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3di9QwEA96Kvji-W29U6IIglKuTdM2ebwTDw_kEE_lngxJmqwLZyvbXcH_3pk0LdfzA_Rtt5mWTjIzmelMfkPIM2Pgct0UqfS2STl4uGAHuU6ZzDREY1ZbF7qWvK2Pj8XpqXwXz3H3Y7X7mJIMljqotaj2-hyx1iD0xZXNeSoukyslgs1giH7yaUodIEh_TF_-9rbZBhRw-n-1xue2o4ulkhfypWEbOtz-LwZukhvR66T7g5jcIpdce5tcG_pQ_rhDPh9hvXqzsfA4OrZMsY6u8GP8-DMWzVHwcqnXiK9Ae_d1mQ6QIhT8-UWoLKCdp2cdPGiq0r5LPh6-_vDqTRobL6QW4od1aoUvvCxZ43WeV6bRzEphNKt8rSUEOEyCFhsMlTz805nh3tXMyJw50xRaFPfIVtu17gGhsrGI6cekhn2wAfMgTZWD9PLMM4SCS0g2roayEZUcm2OcqRCdiEoN06Zg2hROmxIJeTHd8m2A5Pgb8QEu8USIaNrhQrdaqKicKqt1xcHoF15rbrjRpcQzXhJe0jvN4CWfooAoxMtosSBnoTd9r45O3qt9oAMvqq6A6Hkk8h1wAFI-nG-AeUCIrRnl7owSFNrOhp-McqhwCKvgWtdtemQpEzyXIk_I_UEuJ8aYLDGJKxNSzyR2xvl8pF1-CXjipSgqMOwJeTnKrYqGrP_zxD78J-odcp2h4GMnHblLttarjXtErtrv62W_ehwU-CcQ8EG8 priority: 102 providerName: Springer Nature |
| Title | Introducing difference recurrence relations for faster semi-global alignment of long sequences |
| URI | https://link.springer.com/article/10.1186/s12859-018-2014-8 https://www.ncbi.nlm.nih.gov/pubmed/29504909 https://www.proquest.com/docview/2010841981 https://pubmed.ncbi.nlm.nih.gov/PMC5836832 https://doaj.org/article/07a641113faa4b4ba596546940ffea20 |
| Volume | 19 |
| WOSCitedRecordID | wos000425991900004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVADU databaseName: Open Access: BioMedCentral Open Access Titles customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RBZ dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.biomedcentral.com/search/ providerName: BioMedCentral – providerCode: PRVAON databaseName: DOAJ Open Access Full Text customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: DOA dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M~E dateStart: 20000101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: P5Z dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Biological Science Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: M7P dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/biologicalscijournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: K7- dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: 7X7 dateStart: 20090101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: BENPR dateStart: 20090101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: PIMPY dateStart: 20090101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1471-2105 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017805 issn: 1471-2105 databaseCode: RSV dateStart: 20001201 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3db9MwELdggMQL4pvAqAxCQgJFS5wP248b2kQFVFEHqPCAZTvxqLQlU9Mi8d9z5yTVMgS88GI18aWq73627-rL7wh5YQzc5mUSSmfLMAUPF9bBVIdMRhqiMatt5auWvOezmVgsZHGh1BfmhHX0wJ3i9iKu8xTroTutU5ManUl8_0amkXOVZj5aj7gcgqn-_ACZ-vszzFjke22MPG0QNiMq4jQUo13Ik_X_viRf2JMu50teOjT1e9HRbXKrdyLpfvfj75ArVX2X3OjKSv68R75NMf283Fh4mA4VUGxFV_jf-vCxz4Gj4LRSp5EugbbV2TLsGEIouOcnPlGANo6eNvBF26Tr--TT0eHHN2_Dvo5CaCEcWIdWuMTJjJVOx3FuSs2sFEaz3HEtIV5hEialwcjHwZWOTOoqzoyMWWXKRIvkAdmpm7p6RKgsLVL0MalhWythtkuTxwBGsAZDZreARINele1JxrHWxanywYbIVWcKBaZQaAolAvJq-8h5x7DxN-EDNNZWEMmx_Q2AjOoho_4FmYA8R1MrpL-oMb_mRG_aVk2P52of5MAp4jkIveyFXAMjANB2ryuAHpAxayS5O5KE-WlH3c8GRCnswqS2umo2LQ4pEmksRRyQhx3CtgNjMsMzWRkQPsLeaOTjnnr53dODZyLJYZ0OyOsBpapfl9o_K_bx_1DsE3KT4RzDejlyl-ysV5vqKbluf6yX7WpCrvIF962YkGsHh7NiPvGzFtp3PJxg2m0BbZF9hf5i-qH4Alfz48-_ABG6Rq0 |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9QwDI9ggOCFzwGFAQEhITFVtGmuTR4HYtqJ44TYQHsiStLkOGm06HqHtP9-dvohOj4keLtr3KpObMeunZ8JeW4MXC7KLJbeljEHDxfsINcxk4mGaMxq60LXklkxn4vjY_mhO8fd9NXufUoyWOqg1iJ_1aSItQahL65symNxkVzi2GUHQ_TDz0PqAEH6u_Tlb28bbUABp_9Xa_zTdnS-VPJcvjRsQ_s3_ouBm-R653XSvVZMbpELrrpNrrR9KE_vkC9TrFcvNxYeR_uWKdbRFX6M7392RXMUvFzqNeIr0MZ9W8YtpAgFf34RKgto7elJDQ8aqrS3yaf9t0dvDuKu8UJsIX5Yx1b4zMsJK71O09yUmlkpjGa5L7SEAIdJ0GKDoZKHfzox3LuCGZkyZ8pMi-wu2arqyt0nVJYWMf2Y1LAPlmAepMlTkF6eeIZQcBFJ-tVQtkMlx-YYJypEJyJX7bQpmDaF06ZERF4Ot3xvITn-Rvwal3ggRDTtcKFeLVSnnCopdM7B6Gdea2640ROJZ7wkvKR3msFLPkMBUYiXUWFBzkJvmkZNDz-qPaADL6rIgehFR-Rr4ACkvD3fAPOAEFsjyp0RJSi0HQ0_7eVQ4RBWwVWu3jTIUiJ4KkUakXutXA6MMTnBJK6MSDGS2BHn45Fq-TXgiU9EloNhj8huL7eqM2TNnyf2wT9RPyFXD47ez9RsOn_3kFxjqATYVUfukK31auMekcv2x3rZrB4HZT4DJshEoA |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3ri9QwEA96PvCLb8_qqVEEQSnXptk2-Xg-FheP5bhTuU-GJE32Fs722O4K_vfOtGmx5wPEb7vNtDSTeWQ6k98Q8twYuFyUWSy9LWMOO1ywg1zHTCYaojGrrWu7luwX87k4PpYHoc9p01e79ynJ7kwDojRV692z0ncqLvLdJkXcNQiDcZVTHouL5BKHQAZrug6PPg9pBATsD6nM3942ckYtZv-vlvkn13S-bPJc7rR1SdMb_z2Zm-R62I3SvU58bpELrrpNrnT9Kb_fIV9mWMdebiw8mvatVKyjK_xI3_8MxXQUdr_Ua8RdoI37uow7qBEK-_xFW3FAa09Pa3jQUL19l3yavvv45n0cGjLEFuKKdWyFz7ycsNLrNM1NqZmVwmiW-0JLCHyYBO02GEJ5-KcTw70rmJEpc6bMtMjuka2qrtx9QmVpEeuPSQ3-sQSzIU2eglTzxDOEiItI0q-MsgGtHJtmnKo2ahG56timgG0K2aZERF4Ot5x1UB1_I36Nyz0QIsp2e6FeLVRQWpUUOufgDDKvNTfc6InEs18SXtI7zeAln6GwKMTRqLBQZ6E3TaNmR4dqD-hgd1XkQPQiEPkaZgDS3517AD4g9NaIcmdECYpuR8NPe5lUOITVcZWrNw1OKRE8lSKNyHYno8PEmJxgcldGpBhJ72jm45FqedLijE9EloPBj8irXoZVMHDNnxn74J-on5CrB2-nan82__CQXGOoA9hsR-6QrfVq4x6Ry_bbetmsHrd6_QPLuk2E |
| 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=Introducing+difference+recurrence+relations+for+faster+semi-global+alignment+of+long+sequences&rft.jtitle=BMC+bioinformatics&rft.au=Suzuki%2C+Hajime&rft.au=Kasahara%2C+Masahiro&rft.date=2018-02-19&rft.pub=BioMed+Central+Ltd&rft.issn=1471-2105&rft.eissn=1471-2105&rft.volume=19&rft.issue=Suppl+1&rft_id=info:doi/10.1186%2Fs12859-018-2014-8&rft.externalDocID=A546082760 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-2105&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-2105&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-2105&client=summon |