Sciweavers

89 search results - page 5 / 18
» Designing seeds for similarity search in genomic DNA
Sort
View
ASAP
2004
IEEE
124views Hardware» more  ASAP 2004»
13 years 10 months ago
Biosequence Similarity Search on the Mercury System
Biosequence similarity search is an important application in modern molecular biology. Search algorithms aim to identify sets of sequences whose extensional similarity suggests a c...
Praveen Krishnamurthy, Jeremy Buhler, Roger D. Cha...
BMCBI
2005
115views more  BMCBI 2005»
13 years 7 months ago
MPrime: efficient large scale multiple primer and oligonucleotide design for customized gene microarrays
Background: Enhancements in sequencing technology have recently yielded assemblies of large genomes including rat, mouse, human, fruit fly, and zebrafish. The availability of larg...
Eric C. Rouchka, Abdelnaby Khalyfa, Nigel G. F. Co...
APBC
2004
108views Bioinformatics» more  APBC 2004»
13 years 8 months ago
Ladderlike Stepping and Interval Jumping Searching Algorithms for DNA Sequences
In this study we have designed a novel algorithm for searching common segments in multiple DNA sequences. To improve efficiency in pattern searching, combination of hashing encodi...
Tun-Wen Pai, Margaret Dah-Tsyr Chang, Jia-Han Chu,...
BMCBI
2006
112views more  BMCBI 2006»
13 years 7 months ago
GENOMEMASKER package for designing unique genomic PCR primers
Background: The design of oligonucleotides and PCR primers for studying large genomes is complicated by the redundancy of sequences. The eukaryotic genomes are particularly diffic...
Reidar Andreson, Eric Reppo, Lauris Kaplinski, Mai...
CEC
2008
IEEE
14 years 1 months ago
A self-adaptive cellular memetic algorithm for the DNA fragment assembly problem
Abstract— The DNA fragment assembly problem is to reconstruct a DNA chain from multiple fragments that have previously been sequenced in a laboratory. This is a critical step in ...
Bernabé Dorronsoro, Enrique Alba, Gabriel L...