Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

WABI
2007
Springer

favoriteEmaildiscussreport

99views Bioinformatics» more WABI 2007»

A Graph Clustering Approach to Weak Motif Recognition

13 years 10 months ago

A Graph Clustering Approach to Weak Motif Recognition

Download www.cs.uwaterloo.ca

The aim of the motif recognition problem is to detect a set of mutually similar subsequences within a collection of biological sequences. The weak motif recognition problem on DNA sequences is where the sequences are highly degenerate. Our new approach to this problem uses a weighted graph model and a heuristic that determines high weight subgraphs in polynomial time. Our experimental tests show impressive accuracy and eﬃciency. We also give results that demonstrate a theoretical dichotomy between cliques in our graph that represent actual motifs and those that do not.

Christina Boucher, Daniel G. Brown, Paul Church

Real-time Traffic

Algorithms | Motif Recognition Problem | WABI 2007 | Weak Motif Recognition | Weighted Graph Model |

claim paper

Related Content

» RAG RNAAsGraphs web resource

» RAG An Update to the RNAAsGraphs Resource

» HeliCis a DNA motif discovery tool for colocalized motif pairs with periodic spacing

» Graph Alignments A New Concept to Detect Conserved Regions in Protein Active Sites

» Compo composite motif discovery using discrete models

» A new protein motif extraction framework based on constrained coclustering

» Graph Matching Based on Node Signatures

» New approaches for representing analyzing and visualizing complex kinetic transformations

» Graph based event detection from realistic videos using weak feature correspondence

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WABI
Authors	Christina Boucher, Daniel G. Brown, Paul Church

Comments (0)