MotifCut statistics

info info

Citations per year

Number of citations per year for the bioinformatics software tool MotifCut
info

Tool usage distribution map

This map represents all the scientific publications referring to MotifCut per scientific context
info info

Associated diseases

info

Popular tool citations

chevron_left Motif discovery chevron_right
Want to access the full stats & trends on this tool?

MotifCut specifications

Information


Unique identifier OMICS_06270
Name MotifCut
Software type Package/Module
Interface Command line interface
Restrictions to use None
Operating system Unix/Linux
Programming languages C++
Computer skills Advanced
Stability Stable
Maintained Yes

Versioning


No version available

Maintainer


  • person_outline Eugene Fratkin

Information


Unique identifier OMICS_06270
Name MotifCut
Interface Web user interface
Restrictions to use None
Programming languages C++
Computer skills Basic
Stability Stable
Maintained Yes

Maintainer


  • person_outline Eugene Fratkin

Publication for MotifCut

MotifCut citations

 (2)
library_books

PairMotif+: A Fast and Effective Algorithm for De Novo Motif Discovery in DNA sequences

2013
PMCID: 3654438
PMID: 23678291
DOI: 10.7150/ijbs.5786

[…] A-GLAM , SBaSeTraM and BAMBI . Besides the statistical methods, some graph-theoretic methods either based on clustering or on heuristic search are proposed to solve the motif search problem, such as MotifCut , sMCL-WMR and Vine . In the associated graphical model, each node corresponds to an l-mer in input sequences and each edge represents the similarity between the two l-mers it connects.Exact […]

library_books

PairMotif: A New Pattern Driven Algorithm for Planted (l, d) DNA Motif Search

2012
PLoS One
PMCID: 3485246
PMID: 23119020
DOI: 10.1371/journal.pone.0048442

[…] titions all l-mers in S into many buckets, and selects some valid buckets that contain several occurrences of the desired motif and little else. Then EM algorithm is used to refine the valid buckets. MotifCut is a graph-theoretic approach in which motif finding is formulated as a search for the maximum density subgraph. MCEMDA , a Monte Carlo version of the EM motif finding algorithm, starts from […]


Want to access the full list of citations?
MotifCut institution(s)
Department of Computer Science, Stanford University, CA, USA

MotifCut reviews

star_border star_border star_border star_border star_border
star star star star star

Be the first to review MotifCut