Narrow your search

Library

ULiège (3)

EhB (2)

KU Leuven (2)

Odisee (2)

Thomas More Kempen (2)

Thomas More Mechelen (2)

UCLL (2)

ULB (2)

VIVES (2)

AP (1)

More...

Resource type

book (5)

digital (1)


Language

English (6)


Year
From To Submit

2012 (2)

2009 (3)

2004 (1)

Listing 1 - 6 of 6
Sort by

Book
Sequence Comparison : Theory and Methods
Authors: ---
ISBN: 1848003196 1849967822 9786611913663 1281913669 184800320X Year: 2009 Publisher: London : Springer London : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Biomolecular sequence comparison is the origin of bioinformatics. Today, powerful sequence comparison methods, together with comprehensive biological databases, have changed the practice of molecular biology and genomics. This in-depth, state-of-the-art study of sequence alignment and homology search, covers the full spectrum of the field - from alignment methods to the theory of scoring matrices and alignment score statistics. Following a comprehensive introduction, this useful text/reference focuses on algorithms and techniques, as well as discusses the theory. This easy-to-follow text examines alignment methods and techniques, features a new issue of sequence comparison (the spaced-seed technique), addresses several new flexible strategies for coping with various scoring schemes, and covers the theory on the significance of high-scoring segment pairs between two unalignment sequences. Useful appendices are provided for basic concepts in molecular biology, primer in statistics and software for sequence alignment. The book is written for readers with little or no knowledge of biology, algorithms and probability. Features: • Presents a rigorous yet reader-friendly text on the algorithmic techniques and mathematical foundations of sequence alignment and homology search • Offers a tutorial to aid all levels of readers • Covers the basic algorithms and methods for sequence alignment • Introduces popular homology search programs • Familiarizes readers with multiple sequence alignment • Deals with the Karlin-Altschul statistics of optimal local alignment scores • Discusses substitution matrices • Provides end-of-chapter bibliographic notes and further reading suggestions that report related work and recent progresses Based on lectures given to students studying bioinformatics and mathematics, this state-of-the-art study of sequence alignment and homology search is an ideal resource and toolkit for undergraduates and will appeal to biologists who wish to know how to use homology search tools more intelligently.

Keywords

Computer software. --- Computer vision. --- Sequences (Mathematics). --- Sequences (Mathematics) --- Bioinformatics --- Genetic Techniques --- Biology --- Models, Biological --- Biological Science Disciplines --- Investigative Techniques --- Models, Theoretical --- Natural Science Disciplines --- Analytical, Diagnostic and Therapeutic Techniques and Equipment --- Disciplines and Occupations --- Sequence Analysis --- Computational Biology --- Models, Genetic --- Sequence Alignment --- Engineering & Applied Sciences --- Health & Biological Sciences --- Applied Mathematics --- Biology - General --- Bioinformatics. --- Bio-informatics --- Biological informatics --- Mathematical sequences --- Numerical sequences --- Computer science. --- Algorithms. --- Computer graphics. --- Biochemistry. --- Computer Science. --- Computational Biology/Bioinformatics. --- Biochemistry, general. --- Sequences, Series, Summability. --- Computer Imaging, Vision, Pattern Recognition and Graphics. --- Algorithm Analysis and Problem Complexity. --- Information science --- Computational biology --- Systems biology --- Data processing --- Algebra --- Mathematics --- Machine vision --- Vision, Computer --- Artificial intelligence --- Image processing --- Pattern recognition systems --- Software, Computer --- Computer systems --- Biological chemistry --- Chemical composition of organisms --- Organisms --- Physiological chemistry --- Chemistry --- Medical sciences --- Composition --- Optical data processing. --- Optical computing --- Visual data processing --- Bionics --- Electronic data processing --- Integrated optics --- Photonics --- Computers --- Algorism --- Arithmetic --- Optical equipment --- Foundations

Spanning trees and optimization problems
Authors: --- ---
ISBN: 1584884363 9781584884361 Year: 2004 Publisher: Boca Raton, FL ; London ; New York ; Washington, D.C. : ©2004 Chapman & Hall/CRC,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Spanning trees play an important role in the design of efficient routing algorithms and help solve computationally hard problems like the Steiner tree and the traveling salesperson problem. This is one of the most important concepts used in graph theory, as it forms the foundation of many theoretical results in practical fields like scheduling, clustering, data mining, and many others. Spanning Trees and Optimization Problems is the first book published on the use and applications associated with the modern study of spanning trees. It covers properties of spanning trees first, followed by the three categories of spanning trees: minimum spanning trees, shortest-paths trees, and minimum routing cost spanning trees.


Book
Sequence Comparison : Theory and Methods
Authors: --- ---
ISBN: 9781848003200 Year: 2009 Publisher: London Springer London

Loading...
Export citation

Choose an application

Bookmark

Abstract

Biomolecular sequence comparison is the origin of bioinformatics. Today, powerful sequence comparison methods, together with comprehensive biological databases, have changed the practice of molecular biology and genomics. This in-depth, state-of-the-art study of sequence alignment and homology search, covers the full spectrum of the field - from alignment methods to the theory of scoring matrices and alignment score statistics. Following a comprehensive introduction, this useful text/reference focuses on algorithms and techniques, as well as discusses the theory. This easy-to-follow text examines alignment methods and techniques, features a new issue of sequence comparison (the spaced-seed technique), addresses several new flexible strategies for coping with various scoring schemes, and covers the theory on the significance of high-scoring segment pairs between two unalignment sequences. Useful appendices are provided for basic concepts in molecular biology, primer in statistics and software for sequence alignment. The book is written for readers with little or no knowledge of biology, algorithms and probability. Features: ¢ Presents a rigorous yet reader-friendly text on the algorithmic techniques and mathematical foundations of sequence alignment and homology search ¢ Offers a tutorial to aid all levels of readers ¢ Covers the basic algorithms and methods for sequence alignment ¢ Introduces popular homology search programs ¢ Familiarizes readers with multiple sequence alignment ¢ Deals with the Karlin-Altschul statistics of optimal local alignment scores ¢ Discusses substitution matrices ¢ Provides end-of-chapter bibliographic notes and further reading suggestions that report related work and recent progresses Based on lectures given to students studying bioinformatics and mathematics, this state-of-the-art study of sequence alignment and homology search is an ideal resource and toolkit for undergraduates and will appeal to biologists who wish to know how to use homology search tools more intelligently.


Digital
Sequence Comparison : Theory and Methods
Authors: --- --- ---
ISBN: 9781848003200 Year: 2009 Publisher: London Springer London


Book
Algorithms and Computation : 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings
Authors: --- --- ---
ISSN: 03029743 ISBN: 364235260X 3642352618 Year: 2012 Volume: 7676 Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.

Keywords

Computer algorithms --- Engineering & Applied Sciences --- Computer Science --- Numerical calculations --- Data processing --- Computer science. --- Computer communication systems. --- Data structures (Computer science). --- Algorithms. --- Numerical analysis. --- Computer science --- Computer graphics. --- Computer Science. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Computer Communication Networks. --- Computer Graphics. --- Data Structures. --- Numeric Computing. --- Mathematics. --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Computer mathematics --- Discrete mathematics --- Mathematical analysis --- Algorism --- Algebra --- Arithmetic --- Information structures (Computer science) --- Structures, Data (Computer science) --- Structures, Information (Computer science) --- File organization (Computer science) --- Abstract data types (Computer science) --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Informatics --- Science --- Digital techniques --- Mathematics --- Foundations --- Distributed processing --- Numerical analysis --- Computer software. --- Computational complexity. --- Data structures (Computer scienc. --- Electronic data processing. --- Data structures (Computer science) --- ADP (Data processing) --- Automatic data processing --- EDP (Data processing) --- IDP (Data processing) --- Integrated data processing --- Computers --- Office practice --- Complexity, Computational --- Machine theory --- Software, Computer --- Computer systems --- Automation --- Computer science—Mathematics. --- Discrete mathematics. --- Computer networks. --- Artificial intelligence—Data processing. --- Data Science. --- Numerical Analysis. --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical


Book
Algorithms and Computation : 23rd International Symposium, ISAAC 2012, Taipei, Taiwan, December 19-21, 2012. Proceedings
Authors: --- --- ---
ISBN: 9783642352614 Year: 2012 Publisher: Berlin Heidelberg Springer Berlin Heidelberg Imprint Springer

Loading...
Export citation

Choose an application

Bookmark

Abstract

This book constitutes the refereed proceedings of the 23rd International Symposium on Algorithms and Computation, ISAAC 2012, held in Taipei, Taiwan, in December 2012. The 68 revised full papers presented together with three invited talks were carefully reviewed and selected from 174 submissions for inclusion in the book. This volume contains topics such as graph algorithms; online and streaming algorithms; combinatorial optimization; computational complexity; computational geometry; string algorithms; approximation algorithms; graph drawing; data structures; randomized algorithms; and algorithmic game theory.

Keywords

Listing 1 - 6 of 6
Sort by