03152nam 2200661 450 991045438510332120200520144314.01-59693-125-6(CKB)1000000000533983(EBL)338755(OCoLC)476154899(SSID)ssj0000254970(PQKBManifestationID)11218170(PQKBTitleCode)TC0000254970(PQKBWorkID)10229263(PQKB)10527645(MiAaPQ)EBC338755(Au-PeEL)EBL338755(CaPaEBR)ebr10240783(CaBNVSL)mat09100224(IEEE)9100224(EXLCZ)99100000000053398320200730d2007 uy engur|n|---|||||txtccrSystems bioinformatics an engineering case-based approach /Gil Alterovitz, Marco F. Ramoni, editorsNorwood, Massachusetts :Artech House,©2007.[Piscataqay, New Jersey] :IEEE Xplore,[2007]1 online resource (404 p.)Artech House bioinformatics & biomedical imaging seriesDescription based upon print version of record.1-59693-124-8 Includes bibliographical references and indexes.Preface; Part I Introduction: Molecular and Cellular Biology; Chapter 1 Molecular and Cellular Biology: An Engineering Perspective; Chapter 2 Proteomics: From Genome to Proteome; Part II Analysis: Signal Processing; Chapter 3 Introduction to Biological Signal Processing at the Cell Level; Chapter 4 Signal Processing Methods for Mass Spectrometry; Part III Analysis: Control and Systems; Chapter 5 Control and Systems Fundamentals; Chapter 6 Modeling Cellular Networks; Part IV Analysis: Probabilistic Data Networks and Communications.Powerful engineering tools can help solve today?s complex biological and biomedical research challenges? and this first-of-its-kind guide is paving the way . This trail-blazing work gives engineers a quantitative systems approach to bioinformatics research using computational tools drawn from technical disciplines. It presents biological processes in an engineering context to help engineers use their technical skills in solving novel biological problems and also to facilitate reverse engineering from biology in developing synthetic biological devices.Artech House bioinformatics & biomedical imaging series.BioinformaticsBiological systemsCytologyData processingProteomicsData processingElectronic books.Bioinformatics.Biological systems.CytologyData processing.ProteomicsData processing.572.80285Alterovitz Gil891523Ramoni Marco F891524CaBNVSLCaBNVSLCaBNVSLBOOK9910454385103321Systems bioinformatics1991308UNINA06230oam 2200613 450 99646573510331620210716220312.03-540-48523-610.1007/3-540-48523-6(CKB)1000000000211097(SSID)ssj0000321495(PQKBManifestationID)11231242(PQKBTitleCode)TC0000321495(PQKBWorkID)10280168(PQKB)10490628(DE-He213)978-3-540-48523-0(MiAaPQ)EBC3072998(MiAaPQ)EBC6485728(PPN)155168541(EXLCZ)99100000000021109720210716d1999 uy 0engurnn|008mamaatxtccrAutomata, languages and programming 26th International Colloquium, ICALP'99, Prague, Czech Republik, July 11-15, 1999 : proceedings /Jirí Wiedermann, Peter van Emde Boas, Mogens Nielsen (editors)1st ed. 1999.Berlin :Springer,[1999]©19991 online resource (XIV, 726 p.) Lecture notes in computer science ;1644Bibliographic Level Mode of Issuance: Monograph3-540-66224-3 Includes bibliographical references and index.Invited Talks -- Generating Hard Instances of the Short Basis Problem -- Wide Area Computation -- Proof Techniques for Cryptographic Protocols -- Type Structure for Low-Level Programming Languages -- Real Computations with Fake Numbers -- A Model for Associative Memory, a Basis for Thinking and Consciousness -- Numerical Integration with Exact Real Arithmetic -- Observations about the Nature and State of Computer Science -- DNA Computing: New Ideas and Paradigms -- Online Data Structures in External Memory -- From Computational Learning Theory to Discovery Science -- Contributed Papers -- Bounded Depth Arithmetic Circuits: Counting and Closure -- Parametric Temporal Logic for “Model Measuring” -- Communicating Hierarchical State Machines -- Small Pseudo-Random Sets Yield Hard Functions: New Tight Explicit Lower Bounds for Branching Programs -- General Morphisms of Petri Nets (Extended Abstract) -- On Some Tighter Inapproximability Results (Extended Abstract) -- Decomposition and Composition of Timed Automata -- New Applications of the Incompressibility Method (Extended Abstract) -- Mobility Types for Mobile Ambients -- Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains -- Decidable Fragments of Simultaneous Rigid Reachability -- Text Compression Using Antidictionaries -- Non-interactive Zero-Knowledge: A Low-Randomness Characterization of NP (Extended Abstract) -- Timed Alternating Tree Automata: The Automata-Theoretic Solution to the TCTL Model Checking Problem -- Space-Time Tradeoffs for Graph Properties -- Boundedness of Reset P/T Nets -- Two-way finite state transducers and monadic second-order logic -- Partially Ordered Regular Languages for Graph Queries -- Deciding First-Order Properties of Locally Tree-Decomposable Graphs -- Comparison of Process Algebra Equivalences Using Formats -- Compact Routing Tables for Graphs of Bounded Genus (Extended Abstract) -- Computing LOGCFL Certificates -- Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract) -- On the Complements of Partial k-Trees -- Approximation Results for Kinetic Variants of TSP -- Distributed Probabilistic Polling and Applications to Proportionate Agreement -- Bisimulation Equivalence Is Decidable for Normed Process Algebra (Extended abstract) -- A Framework for Decidable Metrical Logics -- On the Power of Las Vegas II. Two-Way Finite Automata -- Stable Marriage with Incomplete Lists and Ties -- Average-Case Complexity of Shellsort (Preliminary Version) -- Linear-Time Construction of Two-Dimensional Suffix Trees (Extended Abstract) -- A Connection between the Star Problem and the Finite Power Property in Trace Monoids (Extended Abstract) -- Two Techniques in the Area of the Star Problem -- Approximations by OBDDs and the Variable Ordering Problem -- Simulation Preorder on Simple Process Algebras -- Solos in Concert -- Shortest Anisotropic Paths on Terrains -- Relations between Local and Global Periodicity of Words (Extended Abstract) -- Efficient Merging, Construction, and Maintenance of Evolutionary Trees -- Formalizing a Lazy Substitution Proof System for ?-Calculus in the Calculus of Inductive Constructions -- Leader Election by d Dimensional Cellular Automata -- New Upper Bounds for MaxSat -- Polynomial and Rational Evaluation and Interpolation (with Structured Matrices) ? -- Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time -- Finite Automata with Generalized Acceptance Criteria -- A Variant of the Arrow Distributed Directory with Low Average Complexity (Extended Abstract) -- Closed Freyd- and ?-categories -- Typed Exceptions and Continuations Cannot Macro-Express Each Other -- Automata, Power Series, and Coinduction: Taking Input Derivatives Seriously (Extended Abstract) -- Accessing Multiple Sequences Through Set Associative Caches -- T(A) = T(B)? -- Many-Valued Logics and Holographic Proofs -- On the Complexity and Inapproximability of Shortest Implicant Problems -- The Wave Propagator Is Turing Computable -- An FPTAS for Agreeably Weighted Variance on a Single Machine (Extended Abstract) -- Erratum: Bulk-Synchronous Parallel Multiplication of Boolean Matrices.Lecture notes in computer science ;1644.Programming languages (Electronic computers)CongressesMachine theoryCongressesFormal languagesCongressesProgramming languages (Electronic computers)Machine theoryFormal languages005.13Emde Boas P. vanNielsen M(Mogens),1949-Wiedermann J(Juraj),MiAaPQMiAaPQUtOrBLWBOOK996465735103316Automata, languages and programming339738UNISA