Some Physical Problems in Bioinformatics

نویسنده

  • Eric D. Siggia
چکیده

Bioinformatics is a data driven field, in which a significant number of problems require statistical modeling. The flood of data emerging from genome centers uses sequence comparison to delimit and assign function to genes, and in very limited ways infers gene control from approximately repeated sequence motifs near to the genes themselves. Traditional topics in computer science such as coding theory, natural language processing, and old fashioned cryptography all impinge on the problem of deducing regulatory information from the genome, but are not probabalistic enough to cope with the fuzziness of biological patterns. The means by which living things encode information is a problem common to both neural biology and the regulation of gene expression by the genome. Physical analogies are employed to highlight some of the problems and opportunities in this area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FOA: ‘Following’ Optimization Algorithm for solving Power engineering optimization problems

These days randomized-based population optimization algorithms are in wide use in different branches of science such as bioinformatics, chemical physics andpower engineering. An important group of these algorithms is inspired by physical processes or entities’ behavior. A new approach of applying optimization-based social relationships among the members of a community is investigated in this pa...

متن کامل

Cellular Automata and Its Applications in Bioinformatics: A Review

This paper aims at providing a survey on the problems that can be easily addressed by cellular automata in bioinformatics. Some of the authors have proposed algorithms for addressing some problems in bioinformatics but the application of cellular automata in bioinformatics is a virgin field in research. None of the researchers has tried to relate the major problems in bioinformatics and find a ...

متن کامل

Efficient Algorithms for Finding Maximum and Maximal Cliques: Effective Tools for Bioinformatics

Many problems can be formulated as graphs where a graph consists of a set of vertices and a set of edges, in which the vertices stand for objects in question and the edges stand for some relations among the objects. A clique is a subgraph in which all pairs of vertices are mutually adjacent. Thus, a maximum clique stands for a maximum collection of objects which are mutually related in some spe...

متن کامل

Statistical Inference for Quadratic Rényi Entropy

Abstract: Entropy and its various generalizations are widely used in mathematical statistics, communication theory, physical and computer sciences for characterizing the amount of information in a probability distribution. We consider estimators of the quadratic Rényi entropy and some related characteristics of discrete and continuous probability distributions based on the number of coincident ...

متن کامل

Molecular solutions for double and partial digest problems in polynomial time

A fundamental problem in computational biology is the construction of physical maps of chromosomes from the hybridization experiments between unique probes and clones of chromosome fragments. Double and partial digest problems are two intractable problems used to construct physical maps of DNA molecules in bioinformatics. Several approaches, including exponential algorithms and heuristic algori...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005