May 292014
 

FindTail 20131220

:: DESCRIPTION

Implemented in C++, FindTail first detects all perfect poly(A) tracts (or homopolymers)in a sequence. Starting with the first tract, FindTail then determines whether the downstream tracts can be merged to form a longer poly(A) fragment using an adjustable gap. After the merging step, it calculates the identity for all resultant poly(A) fragments and remaining tracts, and filter them using an adjustable minimum identity. Finally, the poly(A) length is calculated and filtered by an adjustable minimum length.

::DEVELOPER

Liang Lab

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/ MacOsX/Windows
  • C++ Compiler

:: DOWNLOAD

 FindTail

:: MORE INFORMATION

69 views

Sorry, the comment form is closed at this time.