STS 1.4 – Suffix Tree Searcher

STS 1.4

:: DESCRIPTION

STS (Suffix Tree Searcher) is a Java program for building and exploring indexes of small or large amounts of DNA data. It connects to C programs that do the heavy lifting. The indexes are actually disk-resident partitioned suffix trees, and can be constructed for single or multiple DNA sequences in very flexible ways. The input format is fasta. The output is in the form of tabular results, generally showing longest common substring (LCS) matches among the input sequences. You can also search for exact and inexact occurrences of user specified strings.

::DEVELOPER

theĀ Upton lab

:: SCREENSHOTS

:: REQUIREMENTS

  • Linux / Mac OsX
  • Java

:: DOWNLOAD

STS

:: MORE INFORMATION

Leave a Reply

Your email address will not be published. Required fields are marked *

 

This site uses Akismet to reduce spam. Learn how your comment data is processed.