89 search results - page 10 / 18 » Designing seeds for similarity search in genomic DNA |
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
BMCBI
2006
2006
A jumping profile Hidden Markov Model and applications to recombination sites in HIV and HCV genomes
13 years 8 months ago
Background: Jumping alignments have recently been proposed as a strategy to search a given multiple sequence alignment A against a database. Instead of comparing a database sequen...
BMCBI
2005
13 years 7 months ago
2005
Background: A new algorithm for assessing similarity between primer and template has been developed based on the hypothesis that annealing of primer to template is an information ...
BMCBI
2010
13 years 8 months ago
2010
Background: Current commercial high-density oligonucleotide microarrays can hold millions of probe spots on a single microscopic glass slide and are ideal for studying the transcr...
NAR
2011
12 years 10 months ago
2011
A decade ago, the Gene Expression Omnibus (GEO) database was established at the National Center for Biotechnology Information (NCBI). The original objective of GEO was to serve as...