86 search results - page 3 / 18 » DNA Sequence Design by Dynamic Neighborhood Searches |
RECOMB
2003
Springer
15 years 9 months ago
2003
Springer
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
ALMOB
2006
14 years 9 months ago
2006
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
114
click to vote
WABI
2009
Springer
15 years 4 months ago
2009
Springer
Background: Frameshift mutations in protein-coding DNA sequences produce a drastic change in the resulting protein sequence, which prevents classic protein alignment methods from ...
INFOSCALE
2006
ACM
15 years 3 months ago
2006
ACM
Abstract— Comparing genetic sequences is a well-known problem in bioinformatics. Newly determined sequences are being compared to known sequences stored in databases in order to ...
BMCBI
2007
14 years 9 months ago
2007
Background: Motif discovery aims to detect short, highly conserved patterns in a collection of unaligned DNA or protein sequences. Discriminative motif finding algorithms aim to i...