shustring 2.6 – Compute SHortest Unique SubSTRINGs

shustring 2.6

:: DESCRIPTION

shustring takes one or more sequences as input and returns the corresponding shustrings. The input data need to be in FASTA format, i.e. for each input sequence a definition line followed by the string(s) of residues. Input sequences can be over any alphabet.

::DEVELOPER

Bernhard Haubold

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/ MacOsX
  • C Compiler

:: DOWNLOAD

  shustring

:: MORE INFORMATION

Citation

Bernhard Haubold, Nora Pierstorff, Friedrich Möller and Thomas Wiehe
Genome comparison without alignment using shortest unique substrings
BMC Bioinformatics 2005, 6:123

shulen 1.0 – Null Distribution of Shortest Unique Substring Lengths

shulen 1.0

:: DESCRIPTION

shulen is a program for computing the null-distribution of shortest unique substring lengths in DNA sequences

::DEVELOPER

Bernhard Haubold

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/ MacOsX
  • C Compiler

:: DOWNLOAD

 shulen

:: MORE INFORMATION

Citation

Bernhard Haubold, Nora Pierstorff, Friedrich Möller and Thomas Wiehe
Genome comparison without alignment using shortest unique substrings
BMC Bioinformatics 2005, 6:123