Fast and Practical Algorithms for Planted (l, d) Motif Search

No abstract is available for this paper.

• Publication year

  2007

• Venue

  IEEE/ACM Transactions on Computational Biology & Bioinformatics

• Publication date

  2007-10-01

• Fields of study

  Medicine, Computer Science

• Identifiers
  DOI 10.1109/TCBB.2007.70241PMID 17975266
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar, PubMed

• No claims are published for this paper.

• No concepts are published for this paper.

• Space and Time Efficient Algorithms for Planted Motif Search

  2006cited by this paper
• RISOTTO: Fast Extraction of Motifs with Mismatches

  2006influential reference
• Analysis of computational approaches for motif discovery

  2006cited by this paper
• Voting algorithms for discovering long motifs

  2005influential reference
• Assessing computational tools for the discovery of transcription factor binding sites

  2005cited by this paper
• Exact Algorithms for Planted Motif Problems

  2005cited by this paper
• An Efficient Algorithm for String Motif Discovery

  2005cited by this paper
• A highly scalable algorithm for the extraction of CIS-regulatory regions

  2005influential reference
• Integrating Sample-Driven and Pattern-Driven Approaches in Motif Finding

  2004cited by this paper
• Finding subtle motifs by branching from sample strings

  2003cited by this paper
• Toward Optimal Motif Enumeration

  2003influential reference
• On the complexity of finding common approximate substrings

  2003cited by this paper
• Performance comparison of algorithms for finding transcription factor binding sites

  2003cited by this paper
• Finding composite regulatory patterns in DNA sequences

  2002influential reference
• An algorithm for finding signals of unknown length in DNA sequences

  2001influential reference
• Algorithms for Phylogenetic Footprinting

  2001cited by this paper
• Finding Motifs Using Random Projections

  2001influential reference
• A Statistical Method for Finding Transcription Factor Binding Sites

  2000cited by this paper
• On the closest string and substring problems

  2000cited by this paper
• Extracting structured motifs using a suffix tree—algorithms and application to promoter consensus identification

  2000cited by this paper
• Combinatorial Approaches to Finding Subtle Signals in DNA Sequences

  2000influential reference
• Spelling Approximate Repeated or Common Motifs Using a Suffix Tree

  1998cited by this paper

• Finding the transcription factor binding locations using novel algorithm segmentation to filtration (S2F)

  2024cites this paper
• An Efficient Exact Algorithm for Planted Motif Search on Large DNA Sequence Datasets

  2024cites this paper
• Trie-PMS8: A Trie-tree based Robust Solution for Planted Motif Search Problem

  2024cites this paper
• A new efficient quorum planted (ℓ, d) motif search on ChIP-seq dataset using segmentation to filtration and freezing firefly algorithms

  2023cites this paper
• Exploring Scalable Parallelization for Edit Distance-Based Motif Search

  2023cites this paper
• Detecting Ballistic Motions in Quadruped Robots: A Boosted Tree Motif Classifier for Understanding Reinforcement Learning

  2023cites this paper
• A Method for Predicting DNA Motif Length Based On Deep Learning

  2022cites this paper
• A survey of exact motif finding algorithms

  2022cites this paper
• DNA Sequence Specificity Prediction Algorithm Based on Artificial Intelligence

  2022cites this paper
• A Review on Planted (l, d) Motif Discovery Algorithms for Medical Diagnose

  2022cites this paper
• Freezing firefly algorithm for efficient planted (ℓ, d) motif search

  2022cites this paper
• LL-PMS8: A time efficient approach to solve planted motif search problem

  2020cites this paper
• Discovering Mutated Motifs in DNA Sequences: A Comparative Analysis

  2020cites this paper
• Efficient Algorithms for Finding the Closest <inline-formula><tex-math notation="LaTeX">$l$</tex-math><alternatives><mml:math><mml:mi>l</mml:mi></mml:math><inline-graphic xlink:href="rajasekaran-ieq1-2843364.gif"/></alternatives></inline-formula>-Mers in Biological Data

  2019cites this paper
• Review of Different Sequence Motif Finding Algorithms

  2019cites this paper
• Approximate Algorithms for Regulatory Motif Discovery in DNA

  2019cites this paper
• A modified Henry gas solubility optimization for solving motif discovery problem

  2019cites this paper
• International Journal of Innovative Technology and Exploring Engineering (IJITEE)

  2019cites this paper
• A New Efficient Algorithm for Quorum Planted Motif Search on Large DNA Datasets

  2019cites this paper
• Novel algorithms for LDD motif search

  2019cites this paper
• Software Tools for DNA Motif Similarity Comparison and Analysis

  2019cites this paper
• A Clustering Approach for Motif Discovery in ChIP-Seq Dataset

  2019cites this paper
• SamSelect: a sample sequence selection algorithm for quorum planted motif search on large DNA datasets

  2018cites this paper
• A Selection-based MCL Clustering Algorithm for Motif Discovery

  2018cites this paper
• Exact Planted (l, d) Motif Search Algorithms: A Review

  2018influential citation
• Novel Algorithms for Some Fundamental Big Data Problems

  2018cites this paper
• Research on Algorithms for Planted (l, d) Motif Search

  2018cites this paper
• A Fast and Effective Heuristic Algorithm for Finding Quorum Planted (l, d, q)-Motifs

  2018cites this paper
• RPPMD (Randomly projected possible motif discovery): An efficient bucketing method for finding DNA planted Motif

  2017cites this paper
• Prediction of Calmodulin-Binding Proteins Using Short-Linear Motifs

  2017cites this paper
• Novel algorithms for finding the closest l-mers in biological data

  2017cites this paper
• Identification of DNA motif using particle swarm optimization technique

  2017cites this paper
• Iterative sequential Monte Carlo algorithm for motif discovery

  2016cites this paper
• Cancerous/Disease DNA Prediction Using Fixed Length Motifs/Frequent Patterns Matching

  2016cites this paper
• Prediction of calmodulin-binding proteins using short linear motifs

  2016cites this paper
• qPMS10: A randomized algorithm for efficiently solving quorum Planted Motif Search problem

  2016cites this paper
• Data Structures and Algorithms for the Identification of Biological Patterns

  2016cites this paper
• Discovering Motifs in Biological Sequences Using the Micron Automata Processor

  2016cites this paper
• A New Idea for Improving the Running Time of PMS Algorithm

  2016cites this paper
• RefSelect: a reference sequence selection algorithm for planted (l, d) motif search

  2016cites this paper
• Generalized closest substring encryption

  2015cites this paper
• qPMS9: An Efficient Algorithm for Quorum Planted Motif Search

  2015cites this paper
• Reference sequence selection for motif searches

  2015cites this paper
• An Efficient Exact Algorithm for the Motif Stem Search Problem over Large Alphabets

  2015cites this paper
• Load Balancing for Parallel Motif Discoveries

  2015cites this paper
• Algorithmic techniques for the micron automata processor

  2015cites this paper
• A modified algorithm for DNA motif finding and ranking considering variable length motif and mutation

  2015cites this paper
• An Affinity Propagation-Based DNA Motif Discovery Algorithm

  2015cites this paper
• Discovering common recurrent patterns in multiple strings over large alphabets

  2015cites this paper
• HIGH PERFORMANCE COMPUTING APPROACH FOR MOTIF SEARCH USING OPENMP AND OPENMPI

  2015cites this paper
• Improved Exact Enumerative Algorithms for the Planted (<formula formulatype="inline"><tex Notation="TeX">$l$</tex></formula>, <formula formulatype="inline"><tex Notation="TeX">$d$</tex></formula>)-Motif Search Problem

  2014cites this paper
• PMS6: a fast algorithm for motif discovery

  2014cites this paper
• Scalable Multi-core Implementation for Motif Finding Problem

  2014influential citation
• GAEM: A Hybrid Algorithm Incorporating GA with EM for Planted Edited Motif Finding Problem

  2014cites this paper
• Parallelizing exact motif finding algorithms on multi-core

  2014cites this paper
• A New Exhaustive Method and Strategy for Finding Motifs in ChIP-Enriched Regions

  2014cites this paper
• Finding Motifs in Biological Sequences Using the Micron Automata Processor

  2014cites this paper
• A survey of motif finding Web tools for detecting binding site motifs in ChIP-Seq data

  2014cites this paper
• Parallel Implementation of Exact algorithm for Planted ( l , d ) Motif Search

  2014influential citation
• Regulatory Motif Identification in Biological Sequences: An Overview of Computational Methodologies

  2013cites this paper
• Efficient algorithms for biological stems search

  2013cites this paper
• Efficient sequential and parallel algorithms for planted motif search

  2013cites this paper
• StemFinder: An efficient algorithm for searching motif stems over large alphabets

  2013cites this paper
• PMS: A Panoptic Motif Search Tool

  2013cites this paper
• A fast weak motif-finding algorithm based on community detection in graphs

  2013cites this paper
• A modified algorithm for variable length DNA motif discovery

  2013cites this paper
• High‐performance implementation of planted motif problem on multicore and GPU

  2013cites this paper
• A particle swarm optimization solution for challenging planted(l, d)-Motif problem

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

  2013cites this paper
• An Efficient Algorithm to Identify DNA Motifs

  2013cites this paper
• Advances in Enzyme Biotechnology

  2013cites this paper
• A Heuristic Cluster-Based EM Algorithm for the Planted (L, d) Problem

  2013influential citation
• An improved voting algorithm for planted (l, d) motif search

  2013cites this paper
• PMS6MC: A multicore algorithm for motif discovery

  2013cites this paper
• A MapReduce-based Algorithm for Motif Search

  2012cites this paper
• PMS6: A fast algorithm for motif discovery

  2012influential citation
• A hybrid method for the exact planted (l, d) motif finding problem and its parallelization

  2012cites this paper
• qPMS7: A Fast Algorithm for Finding (ℓ, d)-Motifs in DNA and Protein Sequences

  2012influential citation
• Algorithms for dna sequence assembly and motif search

  2012cites this paper
• Parallel sorting and motif search

  2012influential citation
• Poster: Randomized algorithms for planted Motif Search

  2012cites this paper
• PairMotif: A New Pattern-Driven Algorithm for Planted (l, d) DNA Motif Search

  2012cites this paper
• Direct vs 2-stage approaches to structured motif finding

  2012cites this paper
• PMS5: an efficient exact algorithm for the (ℓ, d)-motif finding problem

  2011influential citation
• An Improved Heuristic Algorithm for Finding Motif Signals in DNA Sequences

  2011influential citation
• High performance implementation of planted motif problem using suffix trees

  2011cites this paper
• A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences

  2011cites this paper
• Efficient and Accurate Discovery of Patterns in Sequence Data Sets

  2011cites this paper
• Solving Planted Motif Problem Using Modeling Method

  2011influential citation
• Computational Techniques for Motif Search

  2011cites this paper
• A Closer Look at the Closest String and Closest Substring Problem

  2011cites this paper
• Efficient Algorithms for Computing With Protein-Based Volumetric Memory Processors

  2011cites this paper
• A speedup technique for (l, d)-motif finding algorithms

  2011cites this paper
• An Experimental Comparison of PMSPrune and Other Algorithms for Motif Search

  2011cites this paper
• Efficient motif finding algorithms for large-alphabet inputs

  2010influential citation
• Fast motif recognition via application of statistical thresholds

  2010influential citation
• Swiftly Computing Center Strings

  2010cites this paper
• An efficient multicore implementation of planted motif problem

  2010cites this paper
• RecMotif: a novel fast algorithm for weak motif discovery

  2010cites this paper
• Optimizing genetic algorithm for motif discovery

  2010cites this paper