Hybrid genetic algorithms for the determination of DNA motifs to satisfy postulate 2-Optimality
- 20 April 2022
- journal article
- research article
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (8) , 8644-8653
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Integration computing and collective intelligenceExpert Systems with Applications, 2015
- Medical consensus, guidelines, and position papers: A policy for the ECFSJournal of Cystic Fibrosis, 2014
- A survey of motif finding Web tools for detecting binding site motifs in ChIP-Seq dataBiology Direct, 2014
- Efficient algorithms for consensus string problems minimizing both distance sum and radiusTheoretical Computer Science, 2011
- Multiple structure alignment and consensus identification for proteinsBMC Bioinformatics, 2010
- Genetic algorithm for dyad pattern finding in DNA sequencesGenes & Genetic Systems, 2009
- Replacement strategies to preserve useful diversity in steady-state genetic algorithmsInformation Sciences, 2008
- Finding composite regulatory patterns in DNA sequencesBioinformatics, 2002
- Adaptive probabilities of crossover and mutation in genetic algorithmsIEEE Transactions on Systems, Man, and Cybernetics, 1994
- An expectation maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequencesProteins: Structure, Function, and Bioinformatics, 1990