Computing Nonoverlapping Inversion Distance Between Two Strings in Linear Average Time

Jan 15, 2019Journal of computational biology : a journal of computational molecular cell biology

Calculating the Minimum Number of Nonoverlapping Inversions Between Two Strings Quickly on Average

AI simplified

Abstract

A linear space and linear average time algorithm for computing inversion distance between two strings is presented.

  • Biological events like inversions are not easily detected by traditional alignment algorithms.
  • A simplification of the alignment problem was introduced, focusing on nonoverlapping inversions.
  • Previous algorithms for this problem had time complexities of ${ ext{O} ( {n^6} ) }$, ${ ext{O} ( {n^3} ) }$, and ${ ext{O} ( {n^2} ) }$.
  • The new algorithm offers a linear average time complexity and uses linear space.
  • The recursive formula proposed for computing inversion distance is novel.
  • Existing literature typically presents algorithms with quadratic space costs.

AI simplified

Full Text

what lands in your inbox each week:

  • 📚7 fresh studies
  • 📝plain-language summaries
  • direct links to original studies
  • 🏅top journal indicators
  • 📅weekly delivery
  • 🧘‍♂️always free