A software library for archiving nondominated points

Author(s):  
Duarte M. Dias ◽  
Alexandre D. Jesus ◽  
Luís Paquete
2021 ◽  
Vol 6 (1) ◽  
Author(s):  
Jing Wui Yeoh ◽  
Neil Swainston ◽  
Peter Vegh ◽  
Valentin Zulkower ◽  
Pablo Carbonell ◽  
...  

Abstract Advances in hardware automation in synthetic biology laboratories are not yet fully matched by those of their software counterparts. Such automated laboratories, now commonly called biofoundries, require software solutions that would help with many specialized tasks such as batch DNA design, sample and data tracking, and data analysis, among others. Typically, many of the challenges facing biofoundries are shared, yet there is frequent wheel-reinvention where many labs develop similar software solutions in parallel. In this article, we present the first attempt at creating a standardized, open-source Python package. A number of tools will be integrated and developed that we envisage will become the obvious starting point for software development projects within biofoundries globally. Specifically, we describe the current state of available software, present usage scenarios and case studies for common problems, and finally describe plans for future development. SynBiopython is publicly available at the following address: http://synbiopython.org.


2014 ◽  
Vol 62 ◽  
pp. 216-226 ◽  
Author(s):  
Peter Bunting ◽  
Daniel Clewley ◽  
Richard M. Lucas ◽  
Sam Gillingham

2010 ◽  
Vol 19 (01) ◽  
pp. 65-99 ◽  
Author(s):  
MARC POULY

Computing inference from a given knowledgebase is one of the key competences of computer science. Therefore, numerous formalisms and specialized inference routines have been introduced and implemented for this task. Typical examples are Bayesian networks, constraint systems or different kinds of logic. It is known today that these formalisms can be unified under a common algebraic roof called valuation algebra. Based on this system, generic inference algorithms for the processing of arbitrary valuation algebras can be defined. Researchers benefit from this high level of abstraction to address open problems independently of the underlying formalism. It is therefore all the more astonishing that this theory did not find its way into concrete software projects. Indeed, all modern programming languages for example provide generic sorting procedures, but generic inference algorithms are still mythical creatures. NENOK breaks a new ground and offers an extensive library of generic inference tools based on the valuation algebra framework. All methods are implemented as distributed algorithms that process local and remote knowledgebases in a transparent manner. Besides its main purpose as software library, NENOK also provides a sophisticated graphical user interface to inspect the inference process and the involved graphical structures. This can be used for educational purposes but also as a fast prototyping architecture for inference formalisms.


2013 ◽  
Vol 16 ◽  
pp. 78-108 ◽  
Author(s):  
Andrew R. Booker ◽  
Andreas Strömbergsson ◽  
Holger Then

AbstractUsing the paths of steepest descent, we prove precise bounds with numerical implied constants for the modified Bessel function${K}_{ir} (x)$of imaginary order and its first two derivatives with respect to the order. We also prove precise asymptotic bounds on more general (mixed) derivatives without working out numerical implied constants. Moreover, we present an absolutely and rapidly convergent series for the computation of${K}_{ir} (x)$and its derivatives, as well as a formula based on Fourier interpolation for computing with many values of$r$. Finally, we have implemented a subset of these features in a software library for fast and rigorous computation of${K}_{ir} (x)$.


2017 ◽  
Vol 83 ◽  
pp. 55-75 ◽  
Author(s):  
Ali Ouni ◽  
Raula Gaikovina Kula ◽  
Marouane Kessentini ◽  
Takashi Ishio ◽  
Daniel M. German ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document