T-WPPDC – Tree-based Weighted-Position Pattern Discovery and Classification

T-WPPDC

:: DESCRIPTION

T-WPPDC is a minimally parameterized algorithm for both pattern discovery and sequence classification that directly incorporates positional information.

::DEVELOPER

Jurisica Lab

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

 T-WPPDC 

:: MORE INFORMATION

Citation

Bioinformatics. 2011 Aug 1;27(15):2054-61. doi: 10.1093/bioinformatics/btr353. Epub 2011 Jun 17.
A tree-based approach for motif discovery and sequence classification.
Yan R1, Boutros PC, Jurisica I.

Teiresias 0.9.1 – Combinatorial Pattern Discovery in Biological Sequences

Teiresias 0.9.1

:: DESCRIPTION

The Teiresias algorithm is a combinatorial algorithm for the discovery of rigid patterns (motifs) in biological sequences.

::DEVELOPER

the Computational Medicine Center at the Sidney Kimmel Medical College of Thomas Jefferson University

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux / Windows/ MacOsX

:: DOWNLOAD

 Teiresias

:: MORE INFORMATION

Tutorial for online or local use

Wikipedia page

Citation:

Bioinformatics. 1998;14(1):55-67.
Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm.
Rigoutsos I1, Floratos A.

SignalSpider – Probabilistic Modeling and Pattern Discovery on Multiple Normalized ChIP-Seq Signal Profile

SignalSpider

:: DESCRIPTION

SignalSpider is a probabilistic model for deciphering the combinatorial binding of DNA-binding proteins. The model (SignalSpider) aims at modeling and extracting patterns from multiple ChIP-Seq profiles.

::DEVELOPER

Ka-Chun Wong

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux / MacOsX / Windows
  • MCR (Matlab Compiler Runtime)

:: DOWNLOAD

 SignalSpider

:: MORE INFORMATION

Citation

SignalSpider: Probabilistic Pattern Discovery on Multiple Normalized ChIP-Seq Signal Profiles.
Wong KC, Li Y, Peng C, Zhang Z.
Bioinformatics. 2014 Sep 5. pii: btu604.

Protomata learner – Complex Pattern Discovery based on Grammatical Inference

Protomata learner 2.0

:: DESCRIPTION

Given a sample of (unaligned) sequences belonging to a structural or functional family of proteins, Protomata-Learner infers automata characterizing the family.

::DEVELOPER

Dyliss (DYnamics, Logics and Inference for biological Systems and Sequences)

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux

:: DOWNLOAD

 Protomata learner

:: MORE INFORMATION

Strmat – String Matching and Pattern Discovery

Strmat

:: DESCRIPTION

Strmat consists of a simple menu system and source C code implementing many exact matching methods, particularly those based on the Z algorithm and on suffix trees.

::DEVELOPER

Dan Gusfield’s group

:: SCREENSHOTS

N/A

:: REQUIREMENTS

  • Linux/MacOsX
  • C Compiler

:: DOWNLOAD

  Strmat

:: MORE INFORMATION

Citation

D. Gusfield;
Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology
Cambridge University Press, 1997