IANDC 2008 - PDF Preprint Papers

IANDC 2008

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IANDC-2008 Paper

click to vote

IANDC
2008

213views more IANDC 2008»

Decision problem for shuffled genes

13 years 6 months ago

Download combio.abo.fi

We consider a permutation-based model for the gene assembly process in ciliates. We give a procedure to decide whether a given micronuclear molecules may be assembled by using onl...

Ion Petre, Vladimir Rogojin

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	213	Decision problem for shuffled genes	claim
2	150	Hierarchical combination of intruder theories	claim
3	141	Graph connectivity, partial words, and a theorem of Fine and Wilf	claim
4	140	Information flow security in Boundary Ambients	claim
5	139	Computational complexity of dynamical systems: The case of cellular automata	claim
6	131	Termination of just/fair computations in term rewriting	claim
7	128	Rule-based static analysis of network protocol implementations	claim
8	122	Automata can show PSpace results for description logics	claim
9	120	A framework for compositional verification of security protocols	claim
10	116	Deciding expressive description logics in the framework of resolution	claim
11	115	Fair multi-party contract signing using private contract signatures	claim
12	114	Generalizing the Paige-Tarjan algorithm by abstract interpretation	claim
13	112	Inclusion dynamics hybrid automata	claim
14	111	Bin packing with controllable item sizes	claim
15	109	Compositions of extended top-down tree transducers	claim
16	105	Symbolic protocol analysis for monoidal equational theories	claim
17	101	Trees with exponentially growing costs	claim
18	95	Comparing communication primitives via their relative expressive power	claim
19	92	Tree exploration with advice	claim
20	89	Anonymity protocols as noisy channels	claim
21	87	Timed Petri nets and timed automata: On the discriminating power of zeno sequences	claim
22	86	Unambiguous Boolean grammars	claim
23	85	1st International Conference on Language and Automata Theory and Applications (LATA 2007)	claim
24	85	Monotony properties of connected visible graph searching	claim
25	84	A theory of system behaviour in the presence of node and link failure	claim
26	84	Authenticating ad hoc networks by comparison of short digests	claim
27	83	Bases for parametrized iterativity	claim
28	81	Universal extensions to simulate specifications	claim
29	81	Complexity of DNF minimization and isomorphism testing for monotone formulas	claim
30	80	Preemptive scheduling on a small number of hierarchical machines	claim
31	80	Optimal vertex ranking of block graphs	claim
32	76	A framework for the verification of infinite-state graph transformation systems	claim
33	76	The number of convex permutominoes	claim
34	75	On finite alphabets and infinite bases	claim
35	74	Execution monitoring enforcement under memory-limitation constraints	claim
36	74	Baire categories on small complexity classes and meager-comeager laws	claim
37	70	Symmetric electoral systems for ambient calculi	claim
38	68	A characterization of flip-accessibility for rhombus tilings of the whole plane	claim
39	62	Muller message-passing automata and logics	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers