An adaptive path through jungle DNA

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

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

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

منابع مشابه

Clarifying the Concepts and Navigating a Path through the Bnc Jungle

In this paper, an attempt is first made to clarify and tease apart the somewhat confusing terms genre, register, text type, domain, sublanguage, and style. The use of these terms by various linguists and literary theorists working under different traditions or orientations will be examined and a possible way of synthesising their insights will be proposed and illustrated with reference to the d...

متن کامل

Paving a pathway through a terminological jungle

Owing to the need to organize information in nearly every discipline, KOSs with varying attributes, content and structures have been developed independently in different domains. These scattered and independent developments have given rise to a conglomeration of classificationrelated terms which tend to be used inconsistently in some research fields, and even more so across different research f...

متن کامل

Through the jungle of biological diversity.

Biological diversity would apparently seem the most intuitive and easily studied of all the ecological concepts. However, in practice biodiversity has suffered from great number of definitions that vary with the specific needs of the different researchers, thus making it extremely confusing as an ecological concept. In this paper, I shortly review the concept of biodiversity showing that there ...

متن کامل

Matchete: Paths through the Pattern Matching Jungle

Pattern matching is a programming language feature for selecting a handler based on the structure of data while binding names to sub-structures. By combining selection and binding, pattern matching facilitates many common tasks such as date normalization, red-black tree manipulation, conversion of XML documents, or decoding TCP/IP packets. Matchete is a language extension to Java that unifies d...

متن کامل

Sublogarithmic approximation for telephone multicast: path out of jungle

Consider a network of processors modeled by an n-vertex graph G = (V,E). Assume that the communication in the network is synchronous, i.e., occurs in discrete “rounds”, and in every round every processor is allowed to pick one of its neighbors, and to send it a message. The telephone k-multicast problem requires to compute a schedule with minimal number of rounds that delivers a message from a ...

متن کامل

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


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

ژورنال

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

سال: 2006

ISSN: 1061-4036,1546-1718

DOI: 10.1038/ng0506-506