On the complexity of sparse exon assembly
From MaRDI portal
Recommendations
- Computing the graph-based parallel complexity of gene assembly
- Sequential vs. Parallel complexity in simple gene assembly
- Computational efficiency of intermolecular gene assembly
- Computational power of intramolecular gene assembly
- Solving a PSPACE-complete problem by gene assembly
- Extended strings and graphs for simple gene assembly
- DESCRIPTIONAL COMPLEXITY OF SPLICING SYSTEMS
Cited in
(9)- Orphan gene finding -- an exon assembly approach.
- On almost Monge all scores matrices
- An almost quadratic time algorithm for sparse spliced alignment
- A protein coding gene alignment algorithm based on SPA
- scientific article; zbMATH DE number 1222690 (Why is no real title available?)
- A method of consolidating and combining EST and mRNA alignments to a genome to enumerate supported splice variants
- Practical software for aligning ESTs to human genome
- A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
- Using multiple alignments to improve gene prediction
This page was built for publication: On the complexity of sparse exon assembly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713541)