Sciweavers

2192 search results - page 7 / 439
» Algorithms for Challenging Motif Problems
Sort
View
WABI
2007
Springer
14 years 2 months ago
A Graph Clustering Approach to Weak Motif Recognition
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 ...
Christina Boucher, Daniel G. Brown, Paul Church
CPM
2008
Springer
170views Combinatorics» more  CPM 2008»
13 years 9 months ago
Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
Nadja Betzler, Michael R. Fellows, Christian Komus...
BIBE
2009
IEEE
126views Bioinformatics» more  BIBE 2009»
14 years 2 months ago
Mining Positional Association Super-Rules on Fixed-Size Protein Sequence Motifs
— Protein sequence motifs information is crucial to the analysis of biologically significant regions. The conserved regions have the potential to determine the role of the protei...
Bernard Chen, Sinan Kockara
PPSN
2004
Springer
14 years 1 months ago
Searching Transcriptional Modules Using Evolutionary Algorithms
The mechanism of gene regulation has been studied intensely for decades. It is important to identify synergistic transcriptional motifs. Its search space is so large that an effici...
Je-Gun Joung, Sok June Oh, Byoung-Tak Zhang
BMCBI
2007
145views more  BMCBI 2007»
13 years 8 months ago
Improved benchmarks for computational motif discovery
Background: An important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods h...
Geir Kjetil Sandve, Osman Abul, Vegard Walseng, Fi...