Decision problem for shuffled genes

Authors:
Ion Petre;Vladimir Rogojin
Affiliations:
Academy of Finland, 00501 Helsinki, Finland and Department of IT, Åbo Akademi, 20520 Turku, Finland and Turku Centre for Computer Science, Turku 20520, Finland;Department of IT, Åbo Akademi, 20520 Turku, Finland and Turku Centre for Computer Science, Turku 20520, Finland
Venue:
Information and Computation
Year:
2008

Citing 12
Cited 2

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Sorting by reversals is difficult

RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

SIAM Journal on Computing
Universal and simple operations for gene assembly in ciliates

Where mathematics, computer science, linguistics and biology meet
Introduction to Algorithms

Introduction to Algorithms
Reversible Molecular Computation in Ciliates

Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Fast Sorting by Reversal

CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)

Computation in Living Cells: Gene Assembly in Ciliates (Natural Computing Series)
Group-theoretic Algorithms for Matrix Multiplication

FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Simple Gene Assembly Is Deterministic

Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Patterns of simple gene assembly in ciliates

Discrete Applied Mathematics

Three models for gene assembly in ciliates: a comparison

Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems
Minimality in template-guided recombination

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecule may be assembled by using only simple dlad operations. We solve the problem based on a notion of dependency graph.