A niched Pareto genetic algorithm for finding variable length regulatory motifs in DNA sequences
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2190-5738
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
A niched Pareto genetic algorithm for finding variable length regulatory motifs in DNA sequences ; volume:2 ; number:2 ; day:9 ; month:12 ; year:2011 ; pages:141-148 ; date:6.2012
3 Biotech ; 2, Heft 2 (9.12.2011), 141-148, 6.2012
- Urheber
-
Vijayvargiya, Shripal
- Beteiligte Personen und Organisationen
-
Shukla, Pratyoosh
SpringerLink (Online service)
- DOI
-
10.1007/s13205-011-0040-6
- URN
-
urn:nbn:de:1111-2016052026874
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:55 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Vijayvargiya, Shripal
- Shukla, Pratyoosh
- SpringerLink (Online service)
Ähnliche Objekte (12)
A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences
New scoring schema for finding motifs in DNA Sequences
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Complexity of finding Pareto-efficient allocations of highest welfare
Finding Pareto-front Membership Functions in Fuzzy Data Mining
Algorithms for finding RNA sequence-structure motifs
RSEARCH: Finding homologs of single structured RNA sequences
Maximum length sequences for radar and synchronization
Maximum Length Sequences for Radar and Synchronization
Pareto Sums of Pareto Sets
Kavosh : a new algorithm for finding network motifs
A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences
New scoring schema for finding motifs in DNA Sequences
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Complexity of finding Pareto-efficient allocations of highest welfare
Finding Pareto-front Membership Functions in Fuzzy Data Mining
Algorithms for finding RNA sequence-structure motifs
RSEARCH: Finding homologs of single structured RNA sequences
Maximum length sequences for radar and synchronization
Maximum Length Sequences for Radar and Synchronization
Pareto Sums of Pareto Sets
Kavosh : a new algorithm for finding network motifs
A Frequent Pattern Mining Method for Finding Planted Motifs of Unknown Length in DNA Sequences
New scoring schema for finding motifs in DNA Sequences
PhyME: A probabilistic algorithm for finding motifs in sets of orthologous sequences
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Complexity of finding Pareto-efficient allocations of highest welfare
Finding Pareto-front Membership Functions in Fuzzy Data Mining
Algorithms for finding RNA sequence-structure motifs
RSEARCH: Finding homologs of single structured RNA sequences
Maximum length sequences for radar and synchronization
Maximum Length Sequences for Radar and Synchronization
Pareto Sums of Pareto Sets