Sciweavers

Share
3 search results - page 1 / 1
» On the Complexity of Sparse Exon Assembly
Sort
View
CPM
2005
Springer
97views Combinatorics» more  CPM 2005»
10 years 8 months ago
On the Complexity of Sparse Exon Assembly
Gene structure prediction is one of the most important problems in computational molecular biology. It involves two steps: the first is finding the evidence (e.g. predicting spl...
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
CORR
2007
Springer
81views Education» more  CORR 2007»
10 years 2 months ago
Faster exon assembly by sparse spliced alignment
Assembling a gene from candidate exons is an important problem in computational biology. Among the most successful approaches to this problem is spliced alignment, proposed by Gelf...
Alexandre Tiskin
BMCBI
2007
158views more  BMCBI 2007»
10 years 3 months ago
Penalized likelihood for sparse contingency tables with an application to full-length cDNA libraries
Background: The joint analysis of several categorical variables is a common task in many areas of biology, and is becoming central to systems biology investigations whose goal is ...
Corinne Dahinden, Giovanni Parmigiani, Mark C. Eme...
books