Cargando…
An expectation-maximization algorithm for probabilistic reconstructions of full-length isoforms from splice graphs
Reconstructing full-length transcript isoforms from sequence fragments (such as ESTs) is a major interest and challenge for bioinformatic analysis of pre-mRNA alternative splicing. This problem has been formulated as finding traversals across the splice graph, which is a directed acyclic graph (DAG)...
| Autores principales: | , , , , , |
|---|---|
| Formato: | Texto |
| Lenguaje: | English |
| Publicado: |
Oxford University Press
2006
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC1475746/ https://www.ncbi.nlm.nih.gov/pubmed/16757580 http://dx.doi.org/10.1093/nar/gkl396 |