112 lines
5.0 KiB
BibTeX
112 lines
5.0 KiB
BibTeX
@techreport{AlhazovFI2016,
|
||
author={Artiom Alhazov and Rudolf Freund and Sergiu Ivanov},
|
||
title={Polymorphic P Systems: A Survey},
|
||
booktitle={Bulletin of the International Membrane Computing Society},
|
||
pages={79--101},
|
||
publisher={IMCS},
|
||
volume={Number 2},
|
||
year={December 2016}
|
||
}
|
||
|
||
@inproceedings{SegretainTGI2021,
|
||
author={Segretain, R{\'e}mi and Trilling, Laurent and Glade, Nicolas and Ivanov, Sergiu},
|
||
title={Who Plays Complex Music? On the Correlations Between Structural
|
||
and Behavioral Complexity Measures in Sign Boolean Networks},
|
||
booktitle={21th IEEE International Conference on BioInformatics and
|
||
BioEngineering — BIBE2021},
|
||
pages={1–6},
|
||
year={2021}
|
||
}
|
||
|
||
@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}
|
||
}
|
||
|
||
@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}
|
||
}
|
||
|
||
@article{AlhazovFIO2015,
|
||
title = {Observations on {P} Systems with States},
|
||
author = {Artiom Alhazov and Rudolf Freund and Sergiu Ivanov and Marion Oswald},
|
||
pages = {17--28},
|
||
journaltitle = {Multidisciplinary Creativity},
|
||
editors = {Marian Gheorghe and Ion Petre and Mario J. P\'erez-Jim\'enez and Grzegorz Rozenberg and Arto Salomaa},
|
||
year = {2015},
|
||
publisher = {Editura Spandugino}
|
||
}
|
||
|
||
@article{AlhazovFIV2022,
|
||
author = {Artiom Alhazov and Rudolf Freund and Sergiu Ivanov and Sergey Verlan},
|
||
title = {Regulated Insertion-Deletion Systems},
|
||
journal = {Journal of Automata, Languages and Combinatorics},
|
||
volume = {27},
|
||
number = {1--3},
|
||
pages = {15--45},
|
||
year = {2022},
|
||
url = {https://doi.org/10.25596/jalc-2022-015},
|
||
doi = {10.25596/jalc-2022-015}
|
||
}
|
||
|
||
@Inproceedings{AlhazovRI2022,
|
||
author = {Alhazov, Artiom and Freund, Rudolf and Ivanov, Sergiu},
|
||
year = {2022},
|
||
title = {P versus B: P Systems as a Formal Framework for Controllability of Boolean Networks},
|
||
editor = {Bordihn, Henning and Horv\'ath, G\'eza and Vaszil, Gy\"orgy},
|
||
booktitle = {{\rm Proceedings 12th International Workshop on}
|
||
Non-Classical Models of Automata and Applications,
|
||
{\rm Debrecen, Hungary, August 26-27, 2022}},
|
||
series = {Electronic Proceedings in Theoretical Computer Science},
|
||
volume = {367},
|
||
publisher = {Open Publishing Association},
|
||
pages = {28-48},
|
||
doi = {10.4204/EPTCS.367.3},
|
||
}
|