Sciweavers

86 search results - page 8 / 18
» DNA Sequence Design by Dynamic Neighborhood Searches
Sort
View
ICPP
2003
IEEE
15 years 2 months ago
FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
Adrian Driga, Paul Lu, Jonathan Schaeffer, Duane S...
BMCBI
2004
150views more  BMCBI 2004»
14 years 9 months ago
SS-Wrapper: a package of wrapper applications for similarity searches on Linux clusters
Background: Large-scale sequence comparison is a powerful tool for biological inference in modern molecular biology. Comparing new sequences to those in annotated databases is a u...
Chunlin Wang, Elliot J. Lefkowitz
BMCBI
2006
88views more  BMCBI 2006»
14 years 9 months ago
RiboSubstrates: a web application addressing the cleavage specificities of ribozymes in designated genomes
Background: RNA-dependent gene silencing is becoming a routine tool used in laboratories worldwide. One of the important remaining hurdles in the selection of the target sequence,...
Jean-François Lucier, Lucien Junior Bergero...
BMCBI
2010
111views more  BMCBI 2010»
14 years 9 months ago
Dynamic probe selection for studying microbial transcriptome with high-density genomic tiling microarrays
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...
Hedda Høvik, Tsute Chen
CIKM
2009
Springer
15 years 1 months ago
Suffix trees for very large genomic sequences
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...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...