Combinatorial Pattern Matching

DOI10.1007/B137128MaRDI QIDQ5713541zbMATHOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20) Analysis of algorithms and problem complexity (68Q25)

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

(8)

• Orphan gene finding -- an exon assembly approach.
• scientific article; zbMATH DE number 2087038 (Why is no real title available?)
• A protein coding gene alignment algorithm based on SPA
• scientific article; zbMATH DE number 1945164 (Why is no real title available?)
• An almost quadratic time algorithm for sparse spliced alignment
• Research in Computational Molecular Biology
• A practical fpt algorithm for F<scp>low</scp> D<scp>ecomposition</scp> and transcript assembly
• On almost Monge all scores matrices

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)