Combinatorial Pattern Matching
From MaRDI portal
Publication:5713541
DOI10.1007/B137128zbMATH Open1130.92300OpenAlexW4301315466MaRDI QIDQ5713541FDOQ5713541
Carmel Kent, Gad M. Landau, Michal Ziv-Ukelson
Publication date: 14 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b137128
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
Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25)
Cited In (8)
- Orphan gene finding -- an exon assembly approach.
- Title not available (Why is that?)
- An almost quadratic time algorithm for sparse spliced alignment
- A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
- On almost Monge all scores matrices
- Research in Computational Molecular Biology
- A protein coding gene alignment algorithm based on SPA
- Title not available (Why is that?)
This page was built for publication: Combinatorial Pattern Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713541)
