SUCCESSFUL ELEMENTARY GENE ASSEMBLY STRATEGIES

DOI10.1142/S0129054109006681zbMath1170.92011MaRDI QIDQ3636157

Vladimir Rogozhin

Publication date: 30 June 2009

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

sorting permutationsciliateselementary operationsintramolecular modelsuccessful elementary assemblies

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Biochemistry, molecular biology (92C40) Cell biology (92C37)

Cites Work

• Sequential vs. Parallel complexity in simple gene assembly
• Patterns of simple gene assembly in ciliates
• Decision problem for shuffled genes
• A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals
• Unnamed Item

This page was built for publication: SUCCESSFUL ELEMENTARY GENE ASSEMBLY STRATEGIES