TCS 2008 - PDF Preprint Papers

TCS 2008 International Conference on Theoretical Computer Science

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed TCS-2008 Paper

click to vote

TCS
2008

229views Theoretical Computer Science» more TCS 2008»

Algorithms for subsequence combinatorics

13 years 11 months ago

Download compalg.inf.elte.hu

A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...

Cees H. Elzinga, Sven Rahmann, Hui Wang

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	229	Algorithms for subsequence combinatorics	claim
2	214	Foundations of Software Science and Computational Structures: Selected papers from FOSSACS 2005	claim
3	184	Modeling spiking neural networks	claim
4	183	GemCell: A generic platform for modeling multi-cellular biological systems	claim
5	175	The cost of offline binary search tree algorithms and the complexity of the request sequence	claim
6	172	Anisotropic diagrams: Labelle Shewchuk approach revisited	claim
7	170	Optimizing deletion cost for secure multicast key management	claim
8	165	Temporal constraints in the logical analysis of regulatory networks	claim
9	163	Kernel methods for learning languages	claim
10	161	Approximate GCDs of polynomials and sparse SOS relaxations	claim
11	155	The complexity of Tarski's fixed point theorem	claim
12	155	Abstract interpretation and types for systems biology	claim
13	153	Another proof of Soittola's theorem	claim
14	153	Comparing evolutionary algorithms to the (1+1)-EA	claim
15	152	Approximation algorithms for partially covering with edges	claim
16	149	Detection of subtle variations as consensus motifs	claim
17	148	The moving curve ideal and the Rees algebra	claim
18	145	A timed semantics of Orc	claim
19	144	Swept regions and surfaces: Modeling and volumetric properties	claim
20	144	Algorithms for computing variants of the longest common subsequence problem	claim
21	143	A characterization of fine words over a finite alphabet	claim
22	143	Extension of Brzozowski's derivation calculus of rational expressions to series over the free partially commutative monoids	claim
23	142	Compositional semantics and behavioral equivalences for P Systems	claim
24	141	Competitive graph searches	claim
25	140	Constructibility and decidability versus domain independence and absoluteness	claim
26	139	The role of information in the cop-robber game	claim
27	137	Computation of distances for regular and context-free probabilistic languages	claim
28	135	Semantic subtyping for the pi-calculus	claim
29	135	Role-based access control for boxed ambients	claim
30	135	On the bandwidth of 3-dimensional Hamming graphs	claim
31	134	An annotated bibliography on guaranteed graph searching	claim
32	133	Bincoloring	claim
33	130	Multi-break rearrangements and chromosomal evolution	claim
34	128	A small trip in the untranquil world of genomes: A survey on the detection and analysis of genome rearrangement breakpoints	claim
35	128	Cryptographically-masked flows	claim
36	126	A simple transitive signature scheme for directed trees	claim
37	126	Arbitrary pattern formation by asynchronous, anonymous, oblivious robots	claim
38	126	Computations with quasiseparable polynomials and matrices	claim
39	125	Reversible computing and cellular automata - A survey	claim
40	125	The complexity of deciding reachability properties of distributed negotiation schemes	claim
41	123	A finite set of functions with an EXPTIME-complete composition problem	claim
42	123	On-line construction of compact suffix vectors and maximal repeats	claim
43	122	On the decidability and complexity of the structural congruence for beta-binders	claim
44	121	Succinct representations of planar maps	claim
45	120	Absolute versus probabilistic classification in a logical setting	claim
46	120	The complexity of uniform Nash equilibria and related regular subgraph problems	claim
47	120	CPO semantics of timed interactive actor networks	claim
48	118	Sound and complete computational interpretation of symbolic hashes in the standard model	claim
49	118	Curves and surfaces represented by polynomial support functions	claim
50	118	On different generalizations of episturmian words	claim
51	118	Distance- k knowledge in self-stabilizing algorithms	claim
52	118	S4 enriched multimodal categorial grammars are context-free: Corrigendum	claim
53	117	The computational complexity of the parallel knock-out problem	claim
54	117	A typed lambda calculus with intersection types	claim
55	117	Analysis of set-up time models: A metric perspective	claim
56	116	An algorithm for recognition of n-collapsing words	claim
57	116	On the complexity of real root isolation using continued fractions	claim
58	116	Reconstruction of convex lattice sets from tomographic projections in quartic time	claim
59	116	Dense open-shop schedules with release times	claim
60	115	Lambda calculus with patterns	claim
61	114	Decidability and syntactic control of interference	claim
62	114	Computational self-assembly	claim
63	113	Efficient corona training protocols for sensor networks	claim
64	113	Fault-free Hamiltonian cycles in twisted cubes with conditional link faults	claim
65	111	Itemset frequency satisfiability: Complexity and axiomatization	claim
66	111	Petri nets are less expressive than state-extended PA	claim
67	111	Density elimination	claim
68	111	Rational subsets of partially reversible monoids	claim
69	108	Jug measuring: Algorithms and complexity	claim
70	108	The NP-hardness of finding a directed acyclic graph for regular resolution	claim
71	108	Setting port numbers for fast graph exploration	claim
72	108	Real algebraic numbers and polynomial systems of small degree	claim
73	107	A new model for selfish routing	claim
74	107	Generating all permutations by context-free grammars in Greibach normal form	claim
75	106	True-concurrency probabilistic models: Markov nets and a law of large numbers	claim
76	105	Digraph measures: Kelly decompositions, games, and orderings	claim
77	105	Paths and trails in edge-colored graphs	claim
78	104	Cleaning a network with brushes	claim
79	104	Minimum-Energy Broadcast and disk cover in grid wireless networks	claim
80	104	Automatic generation of path conditions for concurrent timed systems	claim
81	104	Verification of qualitative Z constraints	claim
82	103	Parikh matrices and amiable words	claim
83	103	Generalized approximate counting revisited	claim
84	103	A unified approach to finding good stable matchings in the hospitals/residents setting	claim
85	103	Machine semantics	claim
86	102	The Magnus-Derek game	claim
87	102	Distributed chasing of network intruders	claim
88	102	Using bisimulation proof techniques for the analysis of distributed abstract machines	claim
89	102	Main-memory triangle computations for very large (sparse (power-law)) graphs	claim
90	101	Tag systems and Collatz-like functions	claim
91	101	Sequential vs. parallel complexity in simple gene assembly	claim
92	101	Integration of a security type system into a program logic	claim
93	101	Spatial-behavioral types for concurrency and resource control in distributed systems	claim
94	100	Security types for dynamic web data	claim
95	100	Structural Presburger digit vector automata	claim
96	99	Algorithmic analysis of polygonal hybrid systems, Part II: Phase portrait and tools	claim
97	99	Making the use of maximal ideals constructive	claim
98	99	Extending FeatherTrait Java with Interfaces	claim
99	99	The weak lambda calculus as a reasonable machine	claim
100	99	A relation between trinucleotide comma-free codes and trinucleotide circular codes	claim
101	99	Information systems revisited - the general continuous case	claim
102	98	Regular languages and their generating functions: The inverse problem	claim
103	98	Bounding lemmata for non-deterministic halting times of transfinite Turing machines	claim
104	98	Complexity of unique list colorability	claim
105	98	Finding a minimum medial axis of a discrete shape is NP-hard	claim
106	98	Game chromatic index of graphs with given restrictions on degrees	claim
107	98	The 2-radius and 2-radiian problems on trees	claim
108	98	On temporal logic constraint solving for analyzing numerical data time series	claim
109	97	Decision problems in membrane systems with peripheral proteins, transport and evolution	claim
110	97	On the complexity of bandwidth allocation in radio networks	claim
111	96	Bayesian inference for differential equations	claim
112	95	Smooth words on 2-letter alphabets having same parity	claim
113	95	Physical constraints on hypercomputation	claim
114	95	On the weight of universal insertion grammars	claim
115	95	On varieties of meet automata	claim
116	94	Quasiperiodic and Lyndon episturmian words	claim
117	93	Solving difference equations whose coefficients are not transcendental	claim
118	92	Fine hierarchies and m-reducibilities in theoretical computer science	claim
119	91	Schur aggregation for linear systems and determinants	claim
120	91	Sequential and parallel triangulating algorithms for Elimination Game and new insights on Minimum Degree	claim
121	90	On process rate semantics	claim
122	90	Cryptographic logical relations	claim
123	90	On strong normalization and type inference in the intersection type discipline	claim
124	89	Scheduling to maximize participation	claim
125	88	Solving NP-complete problems in the tile assembly model	claim
126	88	A type assignment system for game semantics	claim
127	88	On the structure of graphs in the Caucal hierarchy	claim
128	88	Loop detection in term rewriting using the eliminating unfoldings	claim
129	88	Testing whether a digraph contains H-free k-induced subgraphs	claim
130	87	On periodicity of two-dimensional words	claim
131	87	Minimality considerations for ordinal computers modeling constructibility	claim
132	87	Self-deployment of mobile sensors on a ring	claim
133	87	Expanders and time-restricted branching programs	claim
134	86	Motif patterns in 2D	claim
135	86	Seminormal rings (following Thierry Coquand)	claim
136	86	Optimal delay for media-on-demand with pre-loading and pre-buffering	claim
137	86	Directional dynamics for cellular automata: A sensitivity to initial condition approach	claim
138	86	A note on the problem of reporting maximal cliques	claim
139	85	Simple permutations: Decidability and unavoidable substructures	claim
140	85	Learning recursive functions: A survey	claim
141	85	Evolving BlenX programs to simulate the evolution of biological networks	claim
142	84	On a quasi-ordering on Boolean functions	claim
143	84	Election and rendezvous with incomparable labels	claim
144	84	Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems	claim
145	84	Static space-times naturally lead to quasi-pseudometrics	claim
146	84	On the power of lookahead in on-line server routing problems	claim
147	84	Playing with Conway's problem	claim
148	82	On stabilizers of infinite words	claim
149	82	New constructions for provably-secure time-bound hierarchical key assignment schemes	claim
150	81	Turing machines and bimachines	claim
151	81	Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof	claim
152	80	Nondeterministic polynomial time factoring in the tile assembly model	claim
153	79	Learning indexed families of recursive languages from positive data: A survey	claim
154	79	Online unit clustering: Variations on a theme	claim
155	78	The supercover of an m-flat is a discrete analytical object	claim
156	73	Weighted monadic datalog	claim
157	69	Seeing the trees and their branches in the network is hard	claim
158	68	Self-dual tilings with respect to star-duality	claim
159	67	A randomized algorithm for the joining protocol in dynamic distributed networks	claim
160	65	Solving structured linear systems with large displacement rank	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers