Inference algorithms for developmental systems with cell lineages

DOI10.1007/BF02459961zbMath0619.92005OpenAlexW4256049070MaRDI QIDQ1090280

Aristid Lindenmayer, Helmut Jürgensen

Publication date: 1987

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02459961

zbMATH Keywords

computational complexityupper boundsexponential boundinference algorithmscell lineagescontrol of developmentdiscrete generative lineage rulesinteractionless deterministic L systemobserved developmental sequences of tree structures

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Genetics and epigenetics (92D10) Other natural sciences (mathematical treatment) (92F05)

Related Items (2)

A language to describe the growth of neurites ⋮ Elliptic curves and Fibonacci numbers arising from Lindenmayer system with symbolic computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Grammar and L forms: an introduction
• Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology
• Doubly deterministic tabled OL systems
• Life and death in Markov deterministic tabled OL systems
• Growth functions of stochastic Lindenmayer systems
• L homomorphisms and reductions of OL systems

This page was built for publication: Inference algorithms for developmental systems with cell lineages