Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3233547.3233648acmconferencesArticle/Chapter ViewAbstractPublication PagesbcbConference Proceedingsconference-collections
poster
Public Access

An Alignment-free Heuristic for Fast Sequence Comparisons with Applications to Phylogeny Reconstruction

Published: 15 August 2018 Publication History

Abstract

Alignment-free methods for sequence comparisons have become popular in many bioinformatics applications, specifically in the estimation of sequence similarity measures to construct phylogenetic trees. Recently, the average common substring measure, ACS, and its k-mismatch counterpart, ACS_k, have been shown to produce results as effective as multiple-sequence alignment based methods in phylogeny. In this work, we present a novel linear-time heuristic to approximate ACS_k, which is faster than computing the exact ACS_k while being closer to the exact ACS_k values compared to previously published linear-time greedy heuristics.

References

[1]
Chris-Andre Leimeister and Burkhard Morgenstern . 2014. Kmacs: the k-mismatch average common substring approach to alignment-free sequence comparison. Bioinformatics Vol. 30, 14 (2014), 2000--2008.
[2]
Sharma V Thankachan, Sriram P Chockalingam, Yongchao Liu, Ambujam Krishnan, and Srinivas Aluru . 2017. A greedy alignment-free distance estimator for phylogenetic inference. BMC bioinformatics Vol. 18, 8 (2017), 238.

Index Terms

  1. An Alignment-free Heuristic for Fast Sequence Comparisons with Applications to Phylogeny Reconstruction

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      BCB '18: Proceedings of the 2018 ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics
      August 2018
      727 pages
      ISBN:9781450357944
      DOI:10.1145/3233547
      Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 15 August 2018

      Check for updates

      Author Tags

      1. alignment-free matching
      2. approximate sequence matching
      3. phylogeny reconstruction

      Qualifiers

      • Poster

      Funding Sources

      Conference

      BCB '18
      Sponsor:

      Acceptance Rates

      BCB '18 Paper Acceptance Rate 46 of 148 submissions, 31%;
      Overall Acceptance Rate 254 of 885 submissions, 29%

      Upcoming Conference

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • 0
        Total Citations
      • 192
        Total Downloads
      • Downloads (Last 12 months)29
      • Downloads (Last 6 weeks)8
      Reflects downloads up to 30 Aug 2024

      Other Metrics

      Citations

      View Options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Get Access

      Login options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media