✦ LIBER ✦

A formal language-based approach in biology

✍ Scribed by Marian Gheorghe; Victor Mitrana

Publisher: Hindawi Publishing Corporation
Year: 2004
Tongue: English
Weight: 76 KB
Volume: 5
Category: Article
ISSN: 1531-6912
DOI: 10.1002/cfg.364

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A formal language approach for a 3D curv

A formal language approach for a 3D curve representation

✍ E. Bribiesca; C. Velarde 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 799 KB

A tbrmal language approach for representing three-dimensional (3D) curves is presented. Based on the chMn code for representing 3D carves defined in [1], we propose an approach for mapping 3D curves into strings. This mapping allows us to have a unique curve descriptor, which is invariant under tran

A fractal-based image processing languag

A fractal-based image processing language: formal modeling

✍ Nikolaos G. Bourbakis; Chris Alexopoulos 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 345 KB

An image spatial accessing methodology based on a formal language (SCAN) is presented in this paper. SCAN is a special purpose context-free language devoted to describe and generate a wide range of 2-D array accessing algorithms from a short set of simple ones. These algorithms may represent sequent

A unified approach to the generation and

A unified approach to the generation and the acception of formal languages

✍ P. Deussen 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 511 KB

A Library-Based Approach to Task Paralle

A Library-Based Approach to Task Parallelism in a Data-Parallel Language

✍ Ian Foster; David R. Kohr Jr.; Rakesh Krishnaiyer; Alok Choudhary 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Algorithms for producing grammars from s

Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology

✍ Horacio Feliciangeli; Gabor T. Herman 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 926 KB

We give a number of algorithms which for a finite set of finite sequences of strings of symbols decide whether or not there exists a grammar of a certain fixed type such that each of the sequences is a derivation (or subderivation) by the grammar. Whenever such grammars exist, our algorithms will ef

A query language for discovering semanti

A query language for discovering semantic associations, Part I: Approach and formal definition of query primitives

✍ Timo Niemi; Janne Jämsen 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB 👁 1 views

## Abstract In contemporary query languages, the user is responsible for navigation among semantically related data. Because of the huge amount of data and the complex structural relationships among data in modern applications, it is unrealistic to suppose that the user could know completely the co