Literature DB >> 30994912

Evolution of biosequence search algorithms: a brief survey.

Gregory Kucherov1,2.   

Abstract

MOTIVATION: Although modern high-throughput biomolecular technologies produce various types of data, biosequence data remain at the core of bioinformatic analyses. However, computational techniques for dealing with this data evolved dramatically.
RESULTS: In this bird's-eye review, we overview the evolution of main algorithmic techniques for comparing and searching biological sequences. We highlight key algorithmic ideas emerged in response to several interconnected factors: shifts of biological analytical paradigm, advent of new sequencing technologies and a substantial increase in size of the available data. We discuss the expansion of alignment-free techniques coming to replace alignment-based algorithms in large-scale analyses. We further emphasize recently emerged and growing applications of sketching methods which support comparison of massive datasets, such as metagenomics samples. Finally, we focus on the transition to population genomics and outline associated algorithmic challenges.
© The Author(s) 2019. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.

Year:  2019        PMID: 30994912     DOI: 10.1093/bioinformatics/btz272

Source DB:  PubMed          Journal:  Bioinformatics        ISSN: 1367-4803            Impact factor:   6.937


  6 in total

1.  Sequence Comparison Without Alignment: The SpaM Approaches.

Authors:  Burkhard Morgenstern
Journal:  Methods Mol Biol       Date:  2021

Review 2.  A Review of Parallel Implementations for the Smith-Waterman Algorithm.

Authors:  Zeyu Xia; Yingbo Cui; Ang Zhang; Tao Tang; Lin Peng; Chun Huang; Canqun Yang; Xiangke Liao
Journal:  Interdiscip Sci       Date:  2021-09-06       Impact factor: 3.492

3.  Read-SpaM: assembly-free and alignment-free comparison of bacterial genomes with low sequencing coverage.

Authors:  Anna-Katharina Lau; Svenja Dörrer; Chris-André Leimeister; Christoph Bleidorn; Burkhard Morgenstern
Journal:  BMC Bioinformatics       Date:  2019-12-17       Impact factor: 3.169

Review 4.  Algorithms meet sequencing technologies - 10th edition of the RECOMB-Seq workshop.

Authors:  Rob Patro; Leena Salmela
Journal:  iScience       Date:  2020-12-17

5.  A tri-tuple coordinate system derived for fast and accurate analysis of the colored de Bruijn graph-based pangenomes.

Authors:  Jindan Guo; Erli Pang; Hongtao Song; Kui Lin
Journal:  BMC Bioinformatics       Date:  2021-05-27       Impact factor: 3.169

6.  The number of k-mer matches between two DNA sequences as a function of k and applications to estimate phylogenetic distances.

Authors:  Sophie Röhling; Alexander Linne; Jendrik Schellhorn; Morteza Hosseini; Thomas Dencker; Burkhard Morgenstern
Journal:  PLoS One       Date:  2020-02-10       Impact factor: 3.240

  6 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.