dossier-complet/bib/sivanov-extra.bib

55 lines
2.9 KiB
BibTeX
Raw Normal View History

2021-08-27 14:18:14 +02:00
@article {Segretain2020.10.02.323949,
author = {Segretain, R{\'e}mi and Ivanov, Sergiu and Trilling, Laurent and Glade, Nicolas},
title = {Implementation of a Computing Pipeline for Evaluating the Extensibility of Boolean Networks{\textquoteright} Structure and Function},
elocation-id = {2020.10.02.323949},
year = {2020},
doi = {10.1101/2020.10.02.323949},
publisher = {Cold Spring Harbor Laboratory},
abstract = {Formal interaction networks are well suited for representing complex biological systems and have been used to model signalling pathways, gene regulatory networks, interaction within ecosystems, etc. In this paper, we introduce Sign Boolean Networks (SBNs), which are a uniform variant of Threshold Boolean Networks (TBFs). We continue the study of the complexity of SBNs and build a new framework for evaluating their ability to extend, i.e. the potential to gain new functions by addition of nodes, while also maintaining the original functions. We describe our software implementation of this framework and show some first results. These results seem to confirm the conjecture that networks of moderate complexity are the most able to grow, because they are not too simple, but also not too constrained, like the highly complex ones. Biological Regulation, Biological Networks, Sign Boolean Networks, Complexity, Extensibility, Network GrowthCompeting Interest StatementThe authors have declared no competing interest.},
URL = {https://www.biorxiv.org/content/early/2020/10/05/2020.10.02.323949},
eprint = {https://www.biorxiv.org/content/early/2020/10/05/2020.10.02.323949.full.pdf},
journal = {bioRxiv}
}
2020-09-20 21:23:30 +02:00
@article{C:AB20,
author = {Urvan Christen and
Sergiu Ivanov and
Rémi Segretain and
Laurent Trilling and
Nicolas Glade},
title = {On Computing Structural and Behavioral Complexities of Threshold Boolean Networks},
journal = {Acta Biotheoretica},
volume = {68},
pages = {119--138},
year = {2020}
}
@techreport{AGIMPP2014,
title = {Complexity of Model Checking for Reaction Systems},
author = {Azimi, Sepinoud and Gratie, Cristian and Ivanov, Sergiu and Manzoni, Luca and Petre, Ion and Porreca, Antonio E.},
number = {1122},
series = {TUCS Technical Reports},
publisher = {TUCS},
year = {2014},
}
@techreport{AGIP2014,
title = {Dependency Graphs and Mass Conservation in Reaction Systems},
author = {Azimi, Sepinoud and Gratie, Cristian and Ivanov, Sergiu and Petre, Ion},
number = {1123},
series = {TUCS Technical Reports},
publisher = {TUCS},
year = {2014},
keywords = {Reaction system; model checking; mass conservation; conserved set; conservation dependency graph; simulator},
ISBN = {978-952-12-3123-0},
}
@article{IvanovMarcus2015,
Title = {On the Lower Bounds for Leftist Insertion-Deletion Languages},
Author = {Sergiu Ivanov and Sergey Verlan},
Journal = {Annals of the University of Bucharest (Informatics)},
Volume = {LXII(2)},
Pages = {77--88},
Year = {2015}
}