Sciweavers

4421 search results - page 404 / 885
» Libraries
Sort
View
BMCBI
2007
154views more  BMCBI 2007»
15 years 5 months ago
Bounds on the distribution of the number of gaps when circles and lines are covered by fragments: Theory and practical applicati
Background: The question of how a circle or line segment becomes covered when random arcs are marked off has arisen repeatedly in bioinformatics. The number of uncovered gaps is o...
John Moriarty, Julian R. Marchesi, Anthony Metcalf...
CORR
2008
Springer
128views Education» more  CORR 2008»
15 years 5 months ago
A Fast Generic Sequence Matching Algorithm
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...
David R. Musser, Gor V. Nishanov
157
Voted
BMCBI
2006
151views more  BMCBI 2006»
15 years 5 months ago
Modeling Sage data with a truncated gamma-Poisson model
Background: Serial Analysis of Gene Expressions (SAGE) produces gene expression measurements on a discrete scale, due to the finite number of molecules in the sample. This means t...
Helene H. Thygesen, Aeilko H. Zwinderman
BMCBI
2007
109views more  BMCBI 2007»
15 years 5 months ago
Discarding duplicate ditags in LongSAGE analysis may introduce significant error
Background: During gene expression analysis by Serial Analysis of Gene Expression (SAGE), duplicate ditags are routinely removed from the data analysis, because they are suspected...
Jeppe Emmersen, Anna M. Heidenblut, Annabeth Laurs...
132
Voted
BMCBI
2005
79views more  BMCBI 2005»
15 years 4 months ago
Mathematical design of prokaryotic clone-based microarrays
Background: Clone-based microarrays, on which each spot represents a random genomic fragment, are a good alternative to open reading frame-based microarrays, especially for microo...
Bart Pieterse, Elisabeth J. Quirijns, Frank H. J. ...