Accelerating search tree based brute force motif discovery technique on a processor cluster

No abstract is available for this paper.

• Publication year

  2016

• Venue

  Signal Processing and Communications Applications Conference

• Publication date

  2016-05-16

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/SIU.2016.7495859
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Efficient sequential and parallel algorithms for planted motif search

  2013cited by this paper
• A comparative analysis of soft computing techniques for gene prediction.

  2013cited by this paper
• Solving the motif discovery problem by using Differential Evolution with Pareto Tournaments

  2010cited by this paper
• Understanding Bioinformatics

  2009cited by this paper
• MOGAMOD: Multi-objective genetic algorithm for motif discovery

  2009cited by this paper
• Gene Identification: Classical and Computational Intelligence Approaches

  2008cited by this paper
• Computational approaches to gene prediction.

  2006influential reference
• Recent advances in gene structure prediction.

  2004cited by this paper
• Bioinformatics—an introduction for computer scientists

  2004cited by this paper
• TRANSFAC®: transcriptional regulation, from patterns to profiles

  2003cited by this paper
• Computational prediction of eukaryotic protein-coding genes

  2002cited by this paper
• Current methods of gene prediction, their strengths and weaknesses.

  2002cited by this paper
• Gene-finding approaches for eukaryotes.

  2000influential reference
• A Dictionary-Based Approach for Gene Annotation

  1999cited by this paper
• Protein-coding regions prediction combining similarity searches and conservative evolutionary properties of protein-coding sequences.

  1999cited by this paper
• 11 – Gene Finding: Putting the Parts Together

  1998cited by this paper
• An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences

  1990cited by this paper

• The Effect of The Migration Time on The Parallel Particle Swarm Optimization Algorithm

  2020cites this paper