Sciweavers

35 search results - page 3 / 7
» A compression algorithm for DNA sequences and its applicatio...
Sort
View
APBC
2004
108views Bioinformatics» more  APBC 2004»
13 years 7 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
2011
12 years 10 months ago
Combinatorial analysis and algorithms for quasispecies reconstruction using next-generation sequencing
Background: Next-generation sequencing (NGS) offers a unique opportunity for high-throughput genomics and has potential to replace Sanger sequencing in many fields, including de-n...
Mattia C. F. Prosperi, Luciano Prosperi, Alessandr...
BMCBI
2005
158views more  BMCBI 2005»
13 years 6 months ago
Automated generation of heuristics for biological sequence comparison
Background: Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to implement. ...
Guy St. C. Slater, Ewan Birney
BMCBI
2002
131views more  BMCBI 2002»
13 years 6 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
BMCBI
2007
110views more  BMCBI 2007»
13 years 6 months ago
Selection of long oligonucleotides for gene expression microarrays using weighted rank-sum strategy
Background: The design of long oligonucleotides for spotted DNA microarrays requires detailed attention to ensure their optimal performance in the hybridization process. The main ...
Guangan Hu, Manuel Llinás, Jingguang Li, Pe...