Sciweavers

359 search results - page 45 / 72
» On Complexity of Easy Predictable Sequences
Sort
View
ALMOB
2008
95views more  ALMOB 2008»
13 years 7 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
ICMCS
2010
IEEE
229views Multimedia» more  ICMCS 2010»
13 years 8 months ago
Decoder-side motion vector derivation for hybrid video inter coding
The ongoing increase of computing performance facilitates a higher algorithmical complexity in video coding systems. The decoder may be able to estimate or derive prediction param...
Steffen Kamp, Mathias Wien
BMCBI
2010
189views more  BMCBI 2010»
13 years 7 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
BMCBI
2008
204views more  BMCBI 2008»
13 years 7 months ago
EST2uni: an open, parallel tool for automated EST analysis and database creation, with a data mining web interface and microarra
Background: Expressed sequence tag (EST) collections are composed of a high number of single-pass, redundant, partial sequences, which need to be processed, clustered, and annotat...
Javier Forment, Francisco Gilabert Villamón...
ECAL
2007
Springer
14 years 1 months ago
Folding Protein-Like Structures with Open L-Systems
Abstract. Proteins, under native conditions, fold to specific 3D structures according to their 1D amino acid sequence, which in turn is defined by the genetic code. The specific...
Gemma B. Danks, Susan Stepney, Leo S. D. Caves