Sciweavers

15 search results - page 2 / 3
» A Fast Algorithm for the Exhaustive Analysis of 12-Nucleotid...
Sort
View
ALMOB
2008
95views more  ALMOB 2008»
13 years 5 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen
BMCBI
2007
86views more  BMCBI 2007»
13 years 5 months ago
Detecting microsatellites within genomes: significant variation among algorithms
Background: Microsatellites are short, tandemly-repeated DNA sequences which are widely distributed among genomes. Their structure, role and evolution can be analyzed based on exh...
Sébastien Leclercq, Eric Rivals, Philippe J...
BMCBI
2008
104views more  BMCBI 2008»
13 years 5 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
BMCBI
2008
102views more  BMCBI 2008»
13 years 5 months ago
Fast splice site detection using information content and feature reduction
Background: Accurate identification of splice sites in DNA sequences plays a key role in the prediction of gene structure in eukaryotes. Already many computational methods have be...
A. K. M. A. Baten, Saman K. Halgamuge, Bill C. H. ...
CIKM
2009
Springer
13 years 9 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...