Genetic algorithm for dyad pattern finding in DNA sequences

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Genetic algorithm for dyad pattern finding in DNA sequences.

In this paper a novel genetic algorithm is presented for the dyad motif finding problem. The genetic algorithm uses a multi-objective fitness function based on the sum of pairs, the number of matches, and the information content. The individuals required for the population pool in the genetic algorithm are optimized by Gibbs sampling method. Also, new crossover and mutation operators are design...

متن کامل

Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences

In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develop an improved pattern-driven algorithm that takes O(4lk) time, where k is the number of sequences in the sample and l is the motif length, which is independent of the length of each sequence n for large enough l and saving a fa...

متن کامل

Gamot: an Efficient Genetic Algorithm for Finding Challenging Motifs in Dna Sequences

Weak signals that mark transcription factor binding sites involved in gene regulation are considered to be challenging motifs. Identifying these motifs in unaligned DNA sequences is a computationally hard problem which requires efficient algorithms. Genetic Algorithms (GA), inspired from evolution in nature, are a class of stochastic search algorithms which have been applied successfully to man...

متن کامل

A niched Pareto genetic algorithm for finding variable length regulatory motifs in DNA sequences

The transcription factor binding sites also called as motifs are short, recurring patterns in DNA sequences that are presumed to have a biological function. Identification of the motifs from the promoter region of the genes is an important and unsolved problem specifically in the eukaryotic genomes. In this paper, we present a niched Pareto genetic algorithm to identify the regulatory motifs. T...

متن کامل

Finding Sequences in Pattern Languages

This focus group was an experiment. We wanted to know what went on in people’s minds when they constructed sequences from an existing pattern language; i.e. how they selected patterns when attempting to solve a particular design problem. In this case we used the WU pattern language, which focuses on web usability (Graham, 2003). Ian Graham presented it with four of its patterns at EuroPLoP 2002...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Genes & Genetic Systems

سال: 2009

ISSN: 1341-7568,1880-5779

DOI: 10.1266/ggs.84.81