Sciweavers

    TCS
    2008
    95views Theoretical Computer Science» more  TCS 2008»
    On the weight of universal insertion grammars
    13 years 11 months ago
    On the weight of universal insertion grammars
    Download  www.csd.uwo.ca
    We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
    Lila Kari, Petr Sosík
    claim paper
    Read More »
    TCS
    2008
    84views Theoretical Computer Science» more  TCS 2008»
    On a quasi-ordering on Boolean functions
    13 years 11 months ago
    On a quasi-ordering on Boolean functions
    Download  math.tut.fi
    It was proved few years ago that classes of Boolean functions definable by means of functional equations [9], or equivalently, by means of relational constraints [16], coincide wit...
    Miguel Couceiro, Maurice Pouzet
    claim paper
    Read More »
    TCS
    2008
    184views Theoretical Computer Science» more  TCS 2008»
    Modeling spiking neural networks
    13 years 11 months ago
    Modeling spiking neural networks
    Download  daisy.cti.gr
    A notation for the functional specification of a wide range of neural networks consisting of temporal or non-temporal neurons, is proposed. The notation is primarily a mathematica...
    Ioannis D. Zaharakis, Achilles D. Kameas
    claim paper
    Read More »
    TCS
    2008
    80views Theoretical Computer Science» more  TCS 2008»
    Nondeterministic polynomial time factoring in the tile assembly model
    13 years 11 months ago
    Nondeterministic polynomial time factoring in the tile assembly model
    Download  www.cs.washington.edu
    Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
    Yuriy Brun
    claim paper
    Read More »
    TCS
    2008
    144views Theoretical Computer Science» more  TCS 2008»
    Algorithms for computing variants of the longest common subsequence problem
    13 years 11 months ago
    Algorithms for computing variants of the longest common subsequence problem
    Download  www.dcs.kcl.ac.uk
    The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
    Costas S. Iliopoulos, M. Sohel Rahman
    claim paper
    Read More »
    TCS
    2008
    128views Theoretical Computer Science» more  TCS 2008»
    A small trip in the untranquil world of genomes: A survey on the detection and analysis of genome rearrangement breakpoints
    13 years 11 months ago
    A small trip in the untranquil world of genomes: A survey on the detection and analysis of genome rearrangement breakpoints
    Download  perso.numericable.fr
    Genomes are dynamic molecules that are constantly undergoing mutations and rearrangements. The latter are large scale changes in a genome organisation that participate in the evol...
    Claire Lemaitre, Marie-France Sagot
    claim paper
    Read More »
    TCS
    2008
    125views Theoretical Computer Science» more  TCS 2008»
    Reversible computing and cellular automata - A survey
    13 years 11 months ago
    Reversible computing and cellular automata - A survey
    Download  ir.lib.hiroshima-u.ac.jp
    Reversible computing is a paradigm where computing models are so defined that they reflect physical reversibility, one of the fundamental microscopic physical property of Nature. ...
    Kenichi Morita
    claim paper
    Read More »
    TCS
    2008
    101views Theoretical Computer Science» more  TCS 2008»
    Sequential vs. parallel complexity in simple gene assembly
    13 years 11 months ago
    Sequential vs. parallel complexity in simple gene assembly
    Download  combio.abo.fi
    We investigate some differences between the general intramolecular model for gene assembly and its restricted simple model. Although both models satisfactorily sort all current ex...
    Miika Langille, Ion Petre
    claim paper
    Read More »
    TCS
    2008
    149views Theoretical Computer Science» more  TCS 2008»
    Detection of subtle variations as consensus motifs
    13 years 11 months ago
    Detection of subtle variations as consensus motifs
    Download  www.dei.unipd.it
    We address the problem of detecting consensus motifs, that occur with subtle variations, across multiple sequences. These are usually functional domains in DNA sequences such as t...
    Matteo Comin, Laxmi Parida
    claim paper
    Read More »
    TCS
    2008
    88views Theoretical Computer Science» more  TCS 2008»
    Solving NP-complete problems in the tile assembly model
    13 years 11 months ago
    Solving NP-complete problems in the tile assembly model
    Download  www.cs.washington.edu
    Formalized study of self-assembly has led to the definition of the tile assembly model, a highly distributed parallel model of computation that may be implemented using molecules ...
    Yuriy Brun
    claim paper
    Read More »
    « first‹ previous…9899100101102103104105106…next ›last »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.