Sciweavers

64 search results - page 12 / 13
» Finding approximate tandem repeats in genomic sequences
Sort
View
JCO
2006
126views more  JCO 2006»
13 years 5 months ago
Combinatorics of TCP reordering
We study a combinatorial problem motivated by a receiver-oriented model of TCP traffic from [7], that incorporates information on both arrival times, and the dynamics of packet IDs...
Anders Hansson, Gabriel Istrate, Shiva Prasad Kasi...
ICASSP
2009
IEEE
14 years 1 days ago
DNA coding using finite-context models and arithmetic coding
The interest in DNA coding has been growing with the availability of extensive genomic databases. Although only two bits are sufficient to encode the four DNA bases, efficient l...
Armando J. Pinho, António J. R. Neves, Carl...
NAR
2008
85views more  NAR 2008»
13 years 5 months ago
Panzea: an update on new content and features
Panzea (http://www.panzea.org), the public web site of the project `Molecular and Functional Diversity in the Maize Genome', has expanded over the past two years in data cont...
Payan Canaran, Edward S. Buckler, Jeffrey Glaubitz...
BMCBI
2010
185views more  BMCBI 2010»
13 years 5 months ago
ABCtoolbox: a versatile toolkit for approximate Bayesian computations
Background: The estimation of demographic parameters from genetic data often requires the computation of likelihoods. However, the likelihood function is computationally intractab...
Daniel Wegmann, Christoph Leuenberger, Samuel Neue...
IAT
2008
IEEE
13 years 5 months ago
A Game-Theoretic Approach to Determining Efficient Patrolling Strategies for Mobile Robots
Use of game-theoretic models to address patrolling applications has gained increasing interest in the very last years. The patrolling agent is considered playing a game against an...
Francesco Amigoni, Nicola Gatti, Antonio Ippedico