Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Alan Garny

dblp:64/471 · DBLP profile ↗
← Back
6ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0001-7606-5888ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5Software engineering, systems software and programming languages · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
1 paper
Bioinformatics and computational biology · 100%

Topics — the 1 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
computational physiology
0.012011
The Physiome Model Repository 2 · Bioinform. 2011

Methods — techniques the papers use, named apart from their topics

web-based collaboration · 0.1version control · 0.1
YearPublicationVenuePosition
2019 Harmonizing semantic annotations for computational models in biology
abstract
Life science researchers use computational models to articulate and test hypotheses about the behavior of biological systems. Semantic annotation is a critical component for enhancing the interoperability and reusability of such models as well as for the integration of the data needed for model parameterization and validation. Encoded as machine-readable links to knowledge resource terms, semantic annotations describe the computational or biological meaning of what models and data represent. These annotations help researchers find and repurpose models, accelerate model composition and enable knowledge integration across model repositories and experimental data stores. However, realizing the potential benefits of semantic annotation requires the development of model annotation standards that adhere to a community-based annotation protocol. Without such standards, tool developers must account for a variety of annotation formats and approaches, a situation that can become prohibitively cumbersome and which can defeat the purpose of linking model elements to controlled knowledge resource terms. Currently, no consensus protocol for semantic annotation exists among the larger biological modeling community. Here, we report on the landscape of current annotation practices among the COmputational Modeling in BIology NEtwork community and provide a set of recommendations for building a consensus approach to semantic annotation.
Maxwell Lewis Neal, Matthias König 0003, David P. Nickerson, Goksel Misirli, Reza Kalbasi, Andreas Dräger, Koray Atalag, Vijayalakshmi Chelliah, Mike T. Cooling, Daniel L. Cook, Sharon M. Crook, Miguel de Alba, Samuel H. Friedman, Alan Garny, John H. Gennari, Padraig Gleeson, Martin Golebiewski, Michael Hucka, Nick S. Juty, Chris J. Myers, Brett G. Olivier, Herbert M. Sauro, Martin Scharm, Jacky L. Snoep, Vasundra Touré, Anil Wipat, Olaf Wolkenhauer, Dagmar Waltemath
Briefings Bioinform.14
2011 The Physiome Model Repository 2
abstract
MOTIVATION: The Physiome Model Repository 2 (PMR2) software was created as part of the IUPS Physiome Project (Hunter and Borg, 2003), and today it serves as the foundation for the CellML model repository. Key advantages brought to the end user by PMR2 include: facilities for model exchange, enhanced collaboration and a detailed change history for each model. AVAILABILITY: PMR2 is available under an open source license at http://www.cellml.org/tools/pmr/; a fully functional instance of this software can be accessed at http://models.physiomeproject.org/.
Tommy Yu, Catherine M. Lloyd, David P. Nickerson, Mike T. Cooling, Andrew K. Miller, Alan Garny, Jonna R. Terkildsen, James R. Lawson, Randall Britten, Peter J. Hunter, Poul M. F. Nielsen
Bioinform.6
2011 Revision history aware repositories of computational models of biological systems
abstract
BACKGROUND: Building repositories of computational models of biological systems ensures that published models are available for both education and further research, and can provide a source of smaller, previously verified models to integrate into a larger model. One problem with earlier repositories has been the limitations in facilities to record the revision history of models. Often, these facilities are limited to a linear series of versions which were deposited in the repository. This is problematic for several reasons. Firstly, there are many instances in the history of biological systems modelling where an 'ancestral' model is modified by different groups to create many different models. With a linear series of versions, if the changes made to one model are merged into another model, the merge appears as a single item in the history. This hides useful revision history information, and also makes further merges much more difficult, as there is no record of which changes have or have not already been merged. In addition, a long series of individual changes made outside of the repository are also all merged into a single revision when they are put back into the repository, making it difficult to separate out individual changes. Furthermore, many earlier repositories only retain the revision history of individual files, rather than of a group of files. This is an important limitation to overcome, because some types of models, such as CellML 1.1 models, can be developed as a collection of modules, each in a separate file. The need for revision history is widely recognised for computer software, and a lot of work has gone into developing version control systems and distributed version control systems (DVCSs) for tracking the revision history. However, to date, there has been no published research on how DVCSs can be applied to repositories of computational models of biological systems. RESULTS: We have extended the Physiome Model Repository software to be fully revision history aware, by building it on top of Mercurial, an existing DVCS. We have demonstrated the utility of this approach, when used in conjunction with the model composition facilities in CellML, to build and understand more complex models. We have also demonstrated the ability of the repository software to present version history to casual users over the web, and to highlight specific versions which are likely to be useful to users. CONCLUSIONS: Providing facilities for maintaining and using revision history information is an important part of building a useful repository of computational models, as this information is useful both for understanding the source of and justification for parts of a model, and to facilitate automated processes such as merges. The availability of fully revision history aware repositories, and associated tools, will therefore be of significant benefit to the community.
Andrew K. Miller, Tommy Yu, Randall Britten, Mike T. Cooling, James R. Lawson, Dougal Cowan, Alan Garny, Matt D. B. Halstead, Peter J. Hunter, David P. Nickerson, Geoff Nunns, Sarala M. Wimalaratne, Poul M. F. Nielsen
BMC Bioinform.7
2011 Minimum Information About a Simulation Experiment (MIASE)
abstract
This FAIRsharing record describes: The MIASE Guidelines, initiated by the BioModels.net effort, are a community effort to identify the Minimal Information About a Simulation Experiment, necessary to enable the reproducible simulation experiments. Consequently, the MIASE Guidelines list the information that a modeller needs to provide to enable the execution and reproduction of a numerical simulation experiment, derived from a given set of quantitative models. MIASE is a set of guidelines suitable for use with any structured format for simulation experiments. As such, MIASE is designed to help modelers and software tools to exchange their simulation settings and to foster collaboration.
Dagmar Waltemath, Richard R. Adams, Daniel A. Beard, Frank T. Bergmann, Upinder S. Bhalla, Randall Britten, Vijayalakshmi Chelliah, Mike T. Cooling, Jonathan Cooper, Edmund J. Crampin, Alan Garny, Stefan Hoops, Michael Hucka, Peter J. Hunter, Edda Klipp, Camille Laibe, Andrew K. Miller, Ion I. Moraru, David P. Nickerson, Poul M. F. Nielsen, Macha Nikolski, Sven Sahle, Herbert M. Sauro, Henning Schmidt, Jacky L. Snoep, Dominic P. Tolle, Olaf Wolkenhauer, Nicolas Le Novère
PLoS Comput. Biol.11
2010 An overview of the CellML API and its implementation
abstract
BACKGROUND: CellML is an XML based language for representing mathematical models, in a machine-independent form which is suitable for their exchange between different authors, and for archival in a model repository. Allowing for the exchange and archival of models in a computer readable form is a key strategic goal in bioinformatics, because of the associated improvements in scientific record accuracy, the faster iterative process of scientific development, and the ability to combine models into large integrative models.However, for CellML models to be useful, tools which can process them correctly are needed. Due to some of the more complex features present in CellML models, such as imports, developing code ab initio to correctly process models can be an onerous task. For this reason, there is a clear and pressing need for an application programming interface (API), and a good implementation of that API, upon which tools can base their support for CellML. RESULTS: We developed an API which allows the information in CellML models to be retrieved and/or modified. We also developed a series of optional extension APIs, for tasks such as simplifying the handling of connections between variables, dealing with physical units, validating models, and translating models into different procedural languages.We have also provided a Free/Open Source implementation of this application programming interface, optimised to achieve good performance. CONCLUSIONS: Tools have been developed using the API which are mature enough for widespread use. The API has the potential to accelerate the development of additional tools capable of processing CellML, and ultimately lead to an increased level of sharing of mathematical model descriptions.
Andrew K. Miller, Justin Marsh, Adam Reeve, Alan Garny, Randall Britten, Matt D. B. Halstead, Jonathan Cooper, David P. Nickerson, Poul M. F. Nielsen
BMC Bioinform.4
2006 On the application of partial evaluation to the optimisation of cardiac electrophysiological simulations
abstract
Simulating the human heart is a challenging problem, with simulations being very time consuming---some can take days to compute even on high performance computing resources. There is considerable interest in optimisation techniques, with a view to making whole-heart simulations tractable. Reliability of heart model simulations is also of great concern, particularly considering clinical applications. Simulation software should be easily testable (against empirical data) and maintainable, which is often not the case with extensively hand-optimised software. Automating any optimisations will greatly improve this situation. This paper presents a framework for automatically optimising cardiac ionic cell models. An abstract format for such models, CellML [9], has been developed at Auckland University and is gaining in popularity. We utilise this format and investigate robust transformations of models that lead to reduced simulation times. In particular, we demonstrate that partial evaluation [13] is a promising technique for this purpose, and that it combines well with a lookup table technique, commonly used in cardiac modelling, which we have automated. In our tests, the technique of partial evaluation gives a speedup of 1.2 times. Further, applying such transformations prior to the lookup table optimisation results in additional speedups from the latter technique. When both optimisations are used we obtain nearly a 5-fold speedup, compared with a speedup of 1.7 times when lookup tables alone are used.
Jonathan Cooper, Steve McKeever, Alan Garny
PEPM3