Graph theoretic approach to parallel gene assembly

DOI10.1016/j.dam.2008.01.022zbMath1200.05238OpenAlexW2019839205MaRDI QIDQ1003730

Ion Petre, Chang Li, Tero J.Harju

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.022

zbMATH Keywords

split graphsperfect matchingsigned graphslocal complementgene assemblydouble-split graphsparallel assembly

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Protein sequences, DNA sequences (92D20) Signed and weighted graphs (05C22)

Related Items (2)

Graph reductions, binary rank, and pivots in gene assembly ⋮ Computing the graph-based parallel complexity of gene assembly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing the micronuclear gene patterns in ciliates
• Parallelism in gene assembly
• Parallel complexity of signed graphs for gene assembly in ciliates
• Reducing prime graphs and recognizing circle graphs
• Circle graph obstructions
• Computation in living cells. Gene assembly in ciliates
• Template-guided recombination for IES elimination and unscrambling of genes in stichotrichous ciliates
• Reducibility of gene patterns in ciliates using the breakpoint graph.
• CIRCULARITY AND OTHER INVARIANTS OF GENE ASSEMBLY IN CILIATES

This page was built for publication: Graph theoretic approach to parallel gene assembly