TY - JOUR
T1 - A Mathematical Framework for Analyzing Wild Tomato Root Architecture
AU - Chandrasekhar, Arjun
AU - Julkowska, Magdalena M.
N1 - KAUST Repository Item: Exported on 2022-05-25
Acknowledgements: Dr. Julkowska’s study was financed by the King Abdullah University for Science and Technology and the Boyce Thompson Institute.
We thank the organizing committee for the 2021 Biological Distributed Algorithms (BDA) conference, as well as the reviewers for or BDA submission. We thank Guillaume Lobet for help with understanding the output from the plant imaging software. We thank Graham Zug, who is currently working with Dr. Chandrasekhar on mathematical optimization algorithms for constructing Pareto optimal plant arbors. Finally, we thank bioRxiv for hosting a preprint of our study (DOI: 10.1101/2021.08.12.456185).
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2022/4/7
Y1 - 2022/4/7
N2 - The root architecture of wild tomato, Solanum pimpinellifolium, can be viewed as a network connecting the main root to various lateral roots. Several constraints have been proposed on the structure of such biological networks, including minimizing the total amount of wire necessary for constructing the root architecture (wiring cost), and minimizing the distances (and by extension, resource transport time) between the base of the main root and the lateral roots (conduction delay). For a given set of lateral root tip locations, these two objectives compete with each other - optimizing one results in poorer performance on the other - raising the question how well S. pimpinellifolium root architectures balance this network design trade-off in a distributed manner. In this study, we describe how well S. pimpinellifolium roots resolve this trade-off using the theory of Pareto optimality. We describe a mathematical model for characterizing the network structure and design trade-offs governing the structure of S. pimpinellifolium root architecture. We demonstrate that S. pimpinellifolium arbors construct architectures that are more optimal than would be expected by chance. Finally, we use this framework to quantify structural differences between arbors grown in the presence of salt stress, classify arbors into four distinct architectural ideotypes, and test for heritability of variation in root architecture structure.
AB - The root architecture of wild tomato, Solanum pimpinellifolium, can be viewed as a network connecting the main root to various lateral roots. Several constraints have been proposed on the structure of such biological networks, including minimizing the total amount of wire necessary for constructing the root architecture (wiring cost), and minimizing the distances (and by extension, resource transport time) between the base of the main root and the lateral roots (conduction delay). For a given set of lateral root tip locations, these two objectives compete with each other - optimizing one results in poorer performance on the other - raising the question how well S. pimpinellifolium root architectures balance this network design trade-off in a distributed manner. In this study, we describe how well S. pimpinellifolium roots resolve this trade-off using the theory of Pareto optimality. We describe a mathematical model for characterizing the network structure and design trade-offs governing the structure of S. pimpinellifolium root architecture. We demonstrate that S. pimpinellifolium arbors construct architectures that are more optimal than would be expected by chance. Finally, we use this framework to quantify structural differences between arbors grown in the presence of salt stress, classify arbors into four distinct architectural ideotypes, and test for heritability of variation in root architecture structure.
UR - http://hdl.handle.net/10754/678153
UR - https://www.liebertpub.com/doi/10.1089/cmb.2021.0361
UR - http://www.scopus.com/inward/record.url?scp=85128250893&partnerID=8YFLogxK
U2 - 10.1089/cmb.2021.0361
DO - 10.1089/cmb.2021.0361
M3 - Article
C2 - 35235373
SN - 1066-5277
VL - 29
SP - 306
EP - 316
JO - Journal of Computational Biology
JF - Journal of Computational Biology
IS - 4
ER -