Home
»
Grammars and Automata for String Processing
Grammars and Automata for String Processing
Regular price
€173.60
602 verified reviews
100% verified
Delivery/Collection within 10-20 working days
Shipping & Delivery
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Close
advanced macromolecule modelling
bioinformatics algorithms
Category=GB
Category=KNTX
Category=UKR
computational genomics
context-free
deterministic
discrete mathematics models
DNA sequence analysis
empty
enumerable
eq_bestseller
eq_business-finance-law
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
finite
formal
language
language theory applications
molecular sequence simulation
recursively
regular
theory
Product details
- ISBN 9780415298858
- Weight: 894g
- Dimensions: 178 x 254mm
- Publication Date: 16 Jan 2003
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
The conventional wisdom was that biology influenced mathematics and computer science. But a new approach has taken hold: that of transferring methods and tools from computer science to biology. The reverse trend is evident in Grammars and Automata for String Processing: From Mathematics and Computer Science to Biology and Back. The contributors address the structural (syntactical) view of the domain. Mathematical linguistics and computer science can offer various tools for modeling complex macromolecules and for analyzing and simulating biological issues. This collection is valuable for students and researchers in biology, computer science, and applied mathematics.
Martin-Vide, Carlos; Mitrana, Victor
Grammars and Automata for String Processing
€173.60
