Algorithms for determining transposons in gene sequences

TL;DR

This paper develops efficient algorithms to identify transposons in gene sequences by transforming the biological problem into a longest common subsequence problem, considering different sequence types and gene duplication scenarios.

Contribution

It introduces a unified framework and algorithms for detecting transposons in various gene sequence configurations, combining biological insight with graph theory.

Findings

Algorithms for four gene sequence scenarios

Fast computational methods for transposon detection

Theoretical results in combinatorics related to the problem

Abstract

Some genes can change their relative locations in a genome. Thus for different individuals of the same species, the orders of genes might be different. Such jumping genes are called transposons. A practical problem is to determine transposons in given gene sequences. Through an intuitive rule, we transform the biological problem of determining transposons into a rigorous mathematical problem of determining the longest common subsequence. Depending on whether the gene sequence is linear (each sequence has a fixed head and tail) or circular (we can choose any gene as the head, and the previous one is the tail), and whether genes have multiple copies, we classify the problem of determining transposons into four scenarios: (1) linear sequences without duplicated genes; (2) circular sequences without duplicated genes; (3) linear sequences with duplicated genes; (4) circular sequences with duplicated genes. With the help of graph theory, we design fast algorithms for different scenarios. We also derive some results that might be of theoretical interests in combinatorics.