---
_id: '5436'
abstract:
- lang: eng
text: "Recently there has been a significant effort to handle quantitative properties
in formal verification and synthesis. While weighted automata over finite and
infinite words provide a natural and flexible framework to express quantitative
properties, perhaps surprisingly, some basic system properties such as average
response time cannot be expressed using weighted automata, nor in any other know
decidable formalism. In this work, we introduce nested weighted automata as a
natural extension of weighted automata which makes it possible to express important
quantitative properties such as average response time.\r\nIn nested weighted automata,
a master automaton spins off and collects results from weighted slave automata,
each of which computes a quantity along a finite portion of an infinite word.
Nested weighted automata can be viewed as the quantitative analogue of monitor
automata, which are used in run-time verification. We establish an almost complete
decidability picture for the basic decision problems about nested weighted automata,
and illustrate their applicability in several domains. In particular, nested weighted
automata can be used to decide average response time properties."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Otop J. Nested Weighted Automata. IST Austria;
2015. doi:10.15479/AT:IST-2015-170-v2-2
apa: Chatterjee, K., Henzinger, T. A., & Otop, J. (2015). Nested weighted
automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-170-v2-2
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. Nested Weighted
Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-170-v2-2.
ieee: K. Chatterjee, T. A. Henzinger, and J. Otop, Nested weighted automata.
IST Austria, 2015.
ista: Chatterjee K, Henzinger TA, Otop J. 2015. Nested weighted automata, IST Austria,
29p.
mla: Chatterjee, Krishnendu, et al. Nested Weighted Automata. IST Austria,
2015, doi:10.15479/AT:IST-2015-170-v2-2.
short: K. Chatterjee, T.A. Henzinger, J. Otop, Nested Weighted Automata, IST Austria,
2015.
date_created: 2018-12-12T11:39:19Z
date_published: 2015-04-24T00:00:00Z
date_updated: 2023-02-23T12:25:21Z
day: '24'
ddc:
- '000'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:IST-2015-170-v2-2
file:
- access_level: open_access
checksum: 3c402f47d3669c28d04d1af405a08e3f
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:19Z
date_updated: 2020-07-14T12:46:54Z
file_id: '5541'
file_name: IST-2015-170-v2+2_report.pdf
file_size: 569991
relation: main_file
file_date_updated: 2020-07-14T12:46:54Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '29'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '331'
related_material:
record:
- id: '1656'
relation: later_version
status: public
- id: '467'
relation: later_version
status: public
- id: '5415'
relation: earlier_version
status: public
status: public
title: Nested weighted automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5437'
abstract:
- lang: eng
text: "We consider the core algorithmic problems related to verification of systems
with respect to three classical quantitative properties, namely, the mean-payoff
property, the ratio property, and the minimum initial credit for energy property.
\r\nThe algorithmic problem given a graph and a quantitative property asks to
compute the optimal value (the infimum value over all traces) from every node
of the graph. We consider graphs with constant treewidth, and it is well-known
that the control-flow graphs of most programs have constant treewidth. Let $n$
denote the number of nodes of a graph, $m$ the number of edges (for constant treewidth
graphs $m=O(n)$) and $W$ the largest absolute value of the weights.\r\nOur main
theoretical results are as follows.\r\nFirst, for constant treewidth graphs we
present an algorithm that approximates the mean-payoff value within a multiplicative
factor of $\\epsilon$ in time $O(n \\cdot \\log (n/\\epsilon))$ and linear space,
as compared to the classical algorithms that require quadratic time. Second, for
the ratio property we present an algorithm that for constant treewidth graphs
works in time $O(n \\cdot \\log (|a\\cdot b|))=O(n\\cdot\\log (n\\cdot W))$, when
the output is $\\frac{a}{b}$, as compared to the previously best known algorithm
with running time $O(n^2 \\cdot \\log (n\\cdot W))$. Third, for the minimum initial
credit problem we show that (i)~for general graphs the problem can be solved in
$O(n^2\\cdot m)$ time and the associated decision problem can be solved in $O(n\\cdot
m)$ time, improving the previous known $O(n^3\\cdot m\\cdot \\log (n\\cdot W))$
and $O(n^2 \\cdot m)$ bounds, respectively; and (ii)~for constant treewidth graphs
we present an algorithm that requires $O(n\\cdot \\log n)$ time, improving the
previous known $O(n^4 \\cdot \\log (n \\cdot W))$ bound.\r\nWe have implemented
some of our algorithms and show that they present a significant speedup on standard
benchmarks. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. Faster Algorithms for Quantitative
Verification in Constant Treewidth Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-330-v2-1
apa: Chatterjee, K., Ibsen-Jensen, R., & Pavlogiannis, A. (2015). Faster
algorithms for quantitative verification in constant treewidth graphs. IST
Austria. https://doi.org/10.15479/AT:IST-2015-330-v2-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis.
Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-330-v2-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, and A. Pavlogiannis, Faster algorithms
for quantitative verification in constant treewidth graphs. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Pavlogiannis A. 2015. Faster algorithms for
quantitative verification in constant treewidth graphs, IST Austria, 27p.
mla: Chatterjee, Krishnendu, et al. Faster Algorithms for Quantitative Verification
in Constant Treewidth Graphs. IST Austria, 2015, doi:10.15479/AT:IST-2015-330-v2-1.
short: K. Chatterjee, R. Ibsen-Jensen, A. Pavlogiannis, Faster Algorithms for Quantitative
Verification in Constant Treewidth Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:19Z
date_published: 2015-04-27T00:00:00Z
date_updated: 2023-02-23T12:26:05Z
day: '27'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-330-v2-1
file:
- access_level: open_access
checksum: f5917c20f84018b362d385c000a2e123
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:12Z
date_updated: 2020-07-14T12:46:54Z
file_id: '5473'
file_name: IST-2015-330-v2+1_main.pdf
file_size: 1072137
relation: main_file
file_date_updated: 2020-07-14T12:46:54Z
has_accepted_license: '1'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: '27'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '333'
related_material:
record:
- id: '1607'
relation: later_version
status: public
- id: '5430'
relation: earlier_version
status: public
status: public
title: Faster algorithms for quantitative verification in constant treewidth graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5438'
abstract:
- lang: eng
text: "The edit distance between two words w1, w2 is the minimal number of word
operations (letter insertions, deletions, and substitutions) necessary to transform
w1 to w2. The edit distance generalizes to languages L1, L2, where the edit distance
is the minimal number k such that for every word from L1 there exists a word in
L2 with edit distance at most k. We study the edit distance computation problem
between pushdown automata and their subclasses.\r\nThe problem of computing edit
distance to a pushdown automaton is undecidable, and in practice, the interesting
question is to compute the edit distance from a pushdown automaton (the implementation,
a standard model for programs with recursion) to a regular language (the specification).
In this work, we present a complete picture of decidability and complexity for
deciding whether, for a given threshold k, the edit distance from a pushdown automaton
to a finite automaton is at most k. "
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. Edit Distance for Pushdown
Automata. IST Austria; 2015. doi:10.15479/AT:IST-2015-334-v1-1
apa: Chatterjee, K., Henzinger, T. A., Ibsen-Jensen, R., & Otop, J. (2015).
Edit distance for pushdown automata. IST Austria. https://doi.org/10.15479/AT:IST-2015-334-v1-1
chicago: Chatterjee, Krishnendu, Thomas A Henzinger, Rasmus Ibsen-Jensen, and Jan
Otop. Edit Distance for Pushdown Automata. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-334-v1-1.
ieee: K. Chatterjee, T. A. Henzinger, R. Ibsen-Jensen, and J. Otop, Edit distance
for pushdown automata. IST Austria, 2015.
ista: Chatterjee K, Henzinger TA, Ibsen-Jensen R, Otop J. 2015. Edit distance for
pushdown automata, IST Austria, 15p.
mla: Chatterjee, Krishnendu, et al. Edit Distance for Pushdown Automata.
IST Austria, 2015, doi:10.15479/AT:IST-2015-334-v1-1.
short: K. Chatterjee, T.A. Henzinger, R. Ibsen-Jensen, J. Otop, Edit Distance for
Pushdown Automata, IST Austria, 2015.
date_created: 2018-12-12T11:39:20Z
date_published: 2015-05-05T00:00:00Z
date_updated: 2023-02-23T12:20:08Z
day: '05'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-334-v1-1
file:
- access_level: open_access
checksum: 8a5f2d77560e552af87eb1982437a43b
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:56Z
date_updated: 2020-07-14T12:46:55Z
file_id: '5518'
file_name: IST-2015-334-v1+1_report.pdf
file_size: 422573
relation: main_file
file_date_updated: 2020-07-14T12:46:55Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '15'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '334'
related_material:
record:
- id: '1610'
relation: later_version
status: public
- id: '465'
relation: later_version
status: public
status: public
title: Edit distance for pushdown automata
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5439'
abstract:
- lang: eng
text: 'The target discounted-sum problem is the following: Given a rational discount
factor 0 < λ < 1 and three rational values a, b, and t, does there exist a finite
or an infinite sequence w ε(a, b)∗ or w ε(a, b)w, such that Σ|w| i=0 w(i)λi equals
t? The problem turns out to relate to many fields of mathematics and computer
science, and its decidability question is surprisingly hard to solve. We solve
the finite version of the problem, and show the hardness of the infinite version,
linking it to various areas and open problems in mathematics and computer science:
β-expansions, discounted-sum automata, piecewise affine maps, and generalizations
of the Cantor set. We provide some partial results to the infinite version, among
which are solutions to its restriction to eventually-periodic sequences and to
the cases that λ λ 1/2 or λ = 1/n, for every n ε N. We use our results for solving
some open problems on discounted-sum automata, among which are the exact-value
problem for nondeterministic automata over finite words and the universality and
inclusion problems for functional automata. '
alternative_title:
- IST Austria Technical Report
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Jan
full_name: Otop, Jan
id: 2FC5DA74-F248-11E8-B48F-1D18A9856A87
last_name: Otop
citation:
ama: Boker U, Henzinger TA, Otop J. The Target Discounted-Sum Problem. IST
Austria; 2015. doi:10.15479/AT:IST-2015-335-v1-1
apa: Boker, U., Henzinger, T. A., & Otop, J. (2015). The target discounted-sum
problem. IST Austria. https://doi.org/10.15479/AT:IST-2015-335-v1-1
chicago: Boker, Udi, Thomas A Henzinger, and Jan Otop. The Target Discounted-Sum
Problem. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-335-v1-1.
ieee: U. Boker, T. A. Henzinger, and J. Otop, The target discounted-sum problem.
IST Austria, 2015.
ista: Boker U, Henzinger TA, Otop J. 2015. The target discounted-sum problem, IST
Austria, 20p.
mla: Boker, Udi, et al. The Target Discounted-Sum Problem. IST Austria, 2015,
doi:10.15479/AT:IST-2015-335-v1-1.
short: U. Boker, T.A. Henzinger, J. Otop, The Target Discounted-Sum Problem, IST
Austria, 2015.
date_created: 2018-12-12T11:39:20Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2023-02-23T10:08:48Z
day: '18'
ddc:
- '004'
- '512'
- '513'
department:
- _id: ToHe
doi: 10.15479/AT:IST-2015-335-v1-1
file:
- access_level: open_access
checksum: 40405907aa012acece1bc26cf0be554d
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:55Z
date_updated: 2020-07-14T12:46:55Z
file_id: '5517'
file_name: IST-2015-335-v1+1_report.pdf
file_size: 589619
relation: main_file
file_date_updated: 2020-07-14T12:46:55Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '335'
related_material:
record:
- id: '1659'
relation: later_version
status: public
status: public
title: The target discounted-sum problem
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5440'
abstract:
- lang: eng
text: 'Evolution occurs in populations of reproducing individuals. The structure
of the population affects the outcome of the evolutionary process. Evolutionary
graph theory is a powerful approach to study this phenomenon. There are two graphs.
The interaction graph specifies who interacts with whom for payoff in the context
of evolution. The replacement graph specifies who competes with whom for reproduction.
The vertices of the two graphs are the same, and each vertex corresponds to an
individual of the population. The fitness (or the reproductive rate) is a non-negative
number, and depends on the payoff. A key quantity is the fixation probability
of a new mutant. It is defined as the probability that a newly introduced mutant
(on a single vertex) generates a lineage of offspring which eventually takes over
the entire population of resident individuals. The basic computational questions
are as follows: (i) the qualitative question asks whether the fixation probability
is positive; and (ii) the quantitative approximation question asks for an approximation
of the fixation probability. Our main results are as follows: First, we consider
a special case of the general problem, where the residents do not reproduce. We
show that the qualitative question is NP-complete, and the quantitative approximation
question is #P-complete, and the hardness results hold even in the special case
where the interaction and the replacement graphs coincide. Second, we show that
in general both the qualitative and the quantitative approximation questions are
PSPACE-complete. The PSPACE-hardness result for quantitative approximation holds
even when the fitness is always positive.'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Chatterjee K, Ibsen-Jensen R, Nowak M. The Complexity of Evolutionary Games
on Graphs. IST Austria; 2015. doi:10.15479/AT:IST-2015-323-v2-2
apa: Chatterjee, K., Ibsen-Jensen, R., & Nowak, M. (2015). The complexity
of evolutionary games on graphs. IST Austria. https://doi.org/10.15479/AT:IST-2015-323-v2-2
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, and Martin Nowak. The Complexity
of Evolutionary Games on Graphs. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-323-v2-2.
ieee: K. Chatterjee, R. Ibsen-Jensen, and M. Nowak, The complexity of evolutionary
games on graphs. IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Nowak M. 2015. The complexity of evolutionary
games on graphs, IST Austria, 18p.
mla: Chatterjee, Krishnendu, et al. The Complexity of Evolutionary Games on Graphs.
IST Austria, 2015, doi:10.15479/AT:IST-2015-323-v2-2.
short: K. Chatterjee, R. Ibsen-Jensen, M. Nowak, The Complexity of Evolutionary
Games on Graphs, IST Austria, 2015.
date_created: 2018-12-12T11:39:21Z
date_published: 2015-06-16T00:00:00Z
date_updated: 2023-02-23T12:26:10Z
day: '16'
ddc:
- '005'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-323-v2-2
file:
- access_level: open_access
checksum: 66aace7d367032af97c15e35c9be9636
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:23Z
date_updated: 2020-07-14T12:46:56Z
file_id: '5484'
file_name: IST-2015-323-v2+2_main.pdf
file_size: 466161
relation: main_file
file_date_updated: 2020-07-14T12:46:56Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '18'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '338'
related_material:
record:
- id: '5421'
relation: earlier_version
status: public
- id: '5432'
relation: earlier_version
status: public
status: public
title: The complexity of evolutionary games on graphs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5441'
abstract:
- lang: eng
text: We study algorithmic questions for concurrent systems where the transitions
are labeled from a complete, closed semiring, and path properties are algebraic
with semiring operations. The algebraic path properties can model dataflow analysis
problems, the shortest path problem, and many other natural problems that arise
in program analysis. We consider that each component of the concurrent system
is a graph with constant treewidth, a property satisfied by the controlflow graphs
of most programs. We allow for multiple possible queries, which arise naturally
in demand driven dataflow analysis. The study of multiple queries allows us to
consider the tradeoff between the resource usage of the one-time preprocessing
and for each individual query. The traditional approach constructs the product
graph of all components and applies the best-known graph algorithm on the product.
In this approach, even the answer to a single query requires the transitive closure
(i.e., the results of all possible queries), which provides no room for tradeoff
between preprocessing and query time. Our main contributions are algorithms that
significantly improve the worst-case running time of the traditional approach,
and provide various tradeoffs depending on the number of queries. For example,
in a concurrent system of two components, the traditional approach requires hexic
time in the worst case for answering one query as well as computing the transitive
closure, whereas we show that with one-time preprocessing in almost cubic time,
each subsequent query can be answered in at most linear time, and even the transitive
closure can be computed in almost quartic time. Furthermore, we establish conditional
optimality results showing that the worst-case running time of our algorithms
cannot be improved without achieving major breakthroughs in graph algorithms (i.e.,
improving the worst-case bound for the shortest path problem in general graphs).
Preliminary experimental results show that our algorithms perform favorably on
several benchmarks.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
- first_name: Amir
full_name: Goharshady, Amir
id: 391365CE-F248-11E8-B48F-1D18A9856A87
last_name: Goharshady
orcid: 0000-0003-1702-6584
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
citation:
ama: Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. Algorithms
for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components.
IST Austria; 2015. doi:10.15479/AT:IST-2015-340-v1-1
apa: Chatterjee, K., Ibsen-Jensen, R., Goharshady, A. K., & Pavlogiannis, A.
(2015). Algorithms for algebraic path properties in concurrent systems of constant
treewidth components. IST Austria. https://doi.org/10.15479/AT:IST-2015-340-v1-1
chicago: Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Amir Kafshdar Goharshady,
and Andreas Pavlogiannis. Algorithms for Algebraic Path Properties in Concurrent
Systems of Constant Treewidth Components. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-340-v1-1.
ieee: K. Chatterjee, R. Ibsen-Jensen, A. K. Goharshady, and A. Pavlogiannis, Algorithms
for algebraic path properties in concurrent systems of constant treewidth components.
IST Austria, 2015.
ista: Chatterjee K, Ibsen-Jensen R, Goharshady AK, Pavlogiannis A. 2015. Algorithms
for algebraic path properties in concurrent systems of constant treewidth components,
IST Austria, 24p.
mla: Chatterjee, Krishnendu, et al. Algorithms for Algebraic Path Properties
in Concurrent Systems of Constant Treewidth Components. IST Austria, 2015,
doi:10.15479/AT:IST-2015-340-v1-1.
short: K. Chatterjee, R. Ibsen-Jensen, A.K. Goharshady, A. Pavlogiannis, Algorithms
for Algebraic Path Properties in Concurrent Systems of Constant Treewidth Components,
IST Austria, 2015.
date_created: 2018-12-12T11:39:21Z
date_published: 2015-07-11T00:00:00Z
date_updated: 2023-09-19T14:36:19Z
day: '11'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-340-v1-1
file:
- access_level: open_access
checksum: df383dc62c94d7b2ea639aba088a76c6
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:09Z
date_updated: 2020-07-14T12:46:56Z
file_id: '5531'
file_name: IST-2015-340-v1+1_main.pdf
file_size: 861396
relation: main_file
file_date_updated: 2020-07-14T12:46:56Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '24'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '340'
related_material:
record:
- id: '1437'
relation: later_version
status: public
- id: '5442'
relation: earlier_version
status: public
- id: '6009'
relation: later_version
status: public
status: public
title: Algorithms for algebraic path properties in concurrent systems of constant
treewidth components
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5443'
abstract:
- lang: eng
text: POMDPs are standard models for probabilistic planning problems, where an agent
interacts with an uncertain environment. We study the problem of almost-sure reachability,
where given a set of target states, the question is to decide whether there is
a policy to ensure that the target set is reached with probability 1 (almost-surely).
While in general the problem is EXPTIME-complete, in many practical cases policies
with a small amount of memory suffice. Moreover, the existing solution to the
problem is explicit, which first requires to construct explicitly an exponential
reduction to a belief-support MDP. In this work, we first study the existence
of observation-stationary strategies, which is NP-complete, and then small-memory
strategies. We present a symbolic algorithm by an efficient encoding to SAT and
using a SAT solver for the problem. We report experimental results demonstrating
the scalability of our symbolic (SAT-based) approach.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Martin
full_name: Chmelik, Martin
id: 3624234E-F248-11E8-B48F-1D18A9856A87
last_name: Chmelik
- first_name: Jessica
full_name: Davies, Jessica
id: 378E0060-F248-11E8-B48F-1D18A9856A87
last_name: Davies
citation:
ama: Chatterjee K, Chmelik M, Davies J. A Symbolic SAT-Based Algorithm for Almost-Sure
Reachability with Small Strategies in POMDPs. IST Austria; 2015. doi:10.15479/AT:IST-2015-325-v2-1
apa: Chatterjee, K., Chmelik, M., & Davies, J. (2015). A symbolic SAT-based
algorithm for almost-sure reachability with small strategies in POMDPs. IST
Austria. https://doi.org/10.15479/AT:IST-2015-325-v2-1
chicago: Chatterjee, Krishnendu, Martin Chmelik, and Jessica Davies. A Symbolic
SAT-Based Algorithm for Almost-Sure Reachability with Small Strategies in POMDPs.
IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-325-v2-1.
ieee: K. Chatterjee, M. Chmelik, and J. Davies, A symbolic SAT-based algorithm
for almost-sure reachability with small strategies in POMDPs. IST Austria,
2015.
ista: Chatterjee K, Chmelik M, Davies J. 2015. A symbolic SAT-based algorithm for
almost-sure reachability with small strategies in POMDPs, IST Austria, 23p.
mla: Chatterjee, Krishnendu, et al. A Symbolic SAT-Based Algorithm for Almost-Sure
Reachability with Small Strategies in POMDPs. IST Austria, 2015, doi:10.15479/AT:IST-2015-325-v2-1.
short: K. Chatterjee, M. Chmelik, J. Davies, A Symbolic SAT-Based Algorithm for
Almost-Sure Reachability with Small Strategies in POMDPs, IST Austria, 2015.
date_created: 2018-12-12T11:39:22Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2023-02-21T16:24:05Z
day: '06'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-325-v2-1
file:
- access_level: open_access
checksum: f0fa31ad8161ed655137e94012123ef9
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:05Z
date_updated: 2020-07-14T12:46:57Z
file_id: '5466'
file_name: IST-2015-325-v2+1_main.pdf
file_size: 412379
relation: main_file
file_date_updated: 2020-07-14T12:46:57Z
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: '23'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '362'
related_material:
record:
- id: '1166'
relation: later_version
status: public
status: public
title: A symbolic SAT-based algorithm for almost-sure reachability with small strategies
in POMDPs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5444'
abstract:
- lang: eng
text: A comprehensive understanding of the clonal evolution of cancer is critical
for understanding neoplasia. Genome-wide sequencing data enables evolutionary
studies at unprecedented depth. However, classical phylogenetic methods often
struggle with noisy sequencing data of impure DNA samples and fail to detect subclones
that have different evolutionary trajectories. We have developed a tool, called
Treeomics, that allows us to reconstruct the phylogeny of a cancer with commonly
available sequencing technologies. Using Bayesian inference and Integer Linear
Programming, robust phylogenies consistent with the biological processes underlying
cancer evolution were obtained for pancreatic, ovarian, and prostate cancers.
Furthermore, Treeomics correctly identified sequencing artifacts such as those
resulting from low statistical power; nearly 7% of variants were misclassified
by conventional statistical methods. These artifacts can skew phylogenies by creating
illusory tumor heterogeneity among distinct samples. Importantly, we show that
the evolutionary trees generated with Treeomics are mathematically optimal.
alternative_title:
- IST Austria Technical Report
author:
- first_name: Johannes
full_name: Reiter, Johannes
id: 4A918E98-F248-11E8-B48F-1D18A9856A87
last_name: Reiter
orcid: 0000-0002-0170-7353
- first_name: Alvin
full_name: Makohon-Moore, Alvin
last_name: Makohon-Moore
- first_name: Jeffrey
full_name: Gerold, Jeffrey
last_name: Gerold
- first_name: Ivana
full_name: Bozic, Ivana
last_name: Bozic
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Christine
full_name: Iacobuzio-Donahue, Christine
last_name: Iacobuzio-Donahue
- first_name: Bert
full_name: Vogelstein, Bert
last_name: Vogelstein
- first_name: Martin
full_name: Nowak, Martin
last_name: Nowak
citation:
ama: Reiter J, Makohon-Moore A, Gerold J, et al. Reconstructing Robust Phylogenies
of Metastatic Cancers. IST Austria; 2015. doi:10.15479/AT:IST-2015-399-v1-1
apa: Reiter, J., Makohon-Moore, A., Gerold, J., Bozic, I., Chatterjee, K., Iacobuzio-Donahue,
C., … Nowak, M. (2015). Reconstructing robust phylogenies of metastatic cancers.
IST Austria. https://doi.org/10.15479/AT:IST-2015-399-v1-1
chicago: Reiter, Johannes, Alvin Makohon-Moore, Jeffrey Gerold, Ivana Bozic, Krishnendu
Chatterjee, Christine Iacobuzio-Donahue, Bert Vogelstein, and Martin Nowak. Reconstructing
Robust Phylogenies of Metastatic Cancers. IST Austria, 2015. https://doi.org/10.15479/AT:IST-2015-399-v1-1.
ieee: J. Reiter et al., Reconstructing robust phylogenies of metastatic
cancers. IST Austria, 2015.
ista: Reiter J, Makohon-Moore A, Gerold J, Bozic I, Chatterjee K, Iacobuzio-Donahue
C, Vogelstein B, Nowak M. 2015. Reconstructing robust phylogenies of metastatic
cancers, IST Austria, 25p.
mla: Reiter, Johannes, et al. Reconstructing Robust Phylogenies of Metastatic
Cancers. IST Austria, 2015, doi:10.15479/AT:IST-2015-399-v1-1.
short: J. Reiter, A. Makohon-Moore, J. Gerold, I. Bozic, K. Chatterjee, C. Iacobuzio-Donahue,
B. Vogelstein, M. Nowak, Reconstructing Robust Phylogenies of Metastatic Cancers,
IST Austria, 2015.
date_created: 2018-12-12T11:39:22Z
date_published: 2015-12-30T00:00:00Z
date_updated: 2020-07-14T23:05:07Z
day: '30'
ddc:
- '000'
- '576'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2015-399-v1-1
file:
- access_level: open_access
checksum: c47d33bdda06181753c0af36f16e7b5d
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:24Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5485'
file_name: IST-2015-399-v1+1_treeomics.pdf
file_size: 3533200
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '25'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '399'
status: public
title: Reconstructing robust phylogenies of metastatic cancers
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '5549'
abstract:
- lang: eng
text: "This repository contains the experimental part of the CAV 2015 publication
Counterexample Explanation by Learning Small Strategies in Markov Decision Processes.\r\nWe
extended the probabilistic model checker PRISM to represent strategies of Markov
Decision Processes as Decision Trees.\r\nThe archive contains a java executable
version of the extended tool (prism_dectree.jar) together with a few examples
of the PRISM benchmark library.\r\nTo execute the program, please have a look
at the README.txt, which provides instructions and further information on the
archive.\r\nThe archive contains scripts that (if run often enough) reproduces
the data presented in the publication."
article_processing_charge: No
author:
- first_name: Andreas
full_name: Fellner, Andreas
id: 42BABFB4-F248-11E8-B48F-1D18A9856A87
last_name: Fellner
citation:
ama: 'Fellner A. Experimental part of CAV 2015 publication: Counterexample Explanation
by Learning Small Strategies in Markov Decision Processes. 2015. doi:10.15479/AT:ISTA:28'
apa: 'Fellner, A. (2015). Experimental part of CAV 2015 publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:28'
chicago: 'Fellner, Andreas. “Experimental Part of CAV 2015 Publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes.” Institute
of Science and Technology Austria, 2015. https://doi.org/10.15479/AT:ISTA:28.'
ieee: 'A. Fellner, “Experimental part of CAV 2015 publication: Counterexample Explanation
by Learning Small Strategies in Markov Decision Processes.” Institute of Science
and Technology Austria, 2015.'
ista: 'Fellner A. 2015. Experimental part of CAV 2015 publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:28.'
mla: 'Fellner, Andreas. Experimental Part of CAV 2015 Publication: Counterexample
Explanation by Learning Small Strategies in Markov Decision Processes. Institute
of Science and Technology Austria, 2015, doi:10.15479/AT:ISTA:28.'
short: A. Fellner, (2015).
contributor:
- first_name: Jan
id: 44CEF464-F248-11E8-B48F-1D18A9856A87
last_name: Kretinsky
datarep_id: '28'
date_created: 2018-12-12T12:31:29Z
date_published: 2015-08-13T00:00:00Z
date_updated: 2024-02-21T13:52:07Z
day: '13'
ddc:
- '004'
department:
- _id: KrCh
- _id: ToHe
doi: 10.15479/AT:ISTA:28
ec_funded: 1
file:
- access_level: open_access
checksum: b8bcb43c0893023cda66c1b69c16ac62
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:31Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5597'
file_name: IST-2015-28-v1+2_Fellner_DataRep.zip
file_size: 49557109
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
has_accepted_license: '1'
keyword:
- Markov Decision Process
- Decision Tree
- Probabilistic Verification
- Counterexample Explanation
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publisher: Institute of Science and Technology Austria
publist_id: '5564'
related_material:
record:
- id: '1603'
relation: popular_science
status: public
status: public
title: 'Experimental part of CAV 2015 publication: Counterexample Explanation by Learning
Small Strategies in Markov Decision Processes'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2015'
...
---
_id: '10794'
abstract:
- lang: eng
text: Mathematical models are of fundamental importance in the understanding of
complex population dynamics. For instance, they can be used to predict the population
evolution starting from different initial conditions or to test how a system responds
to external perturbations. For this analysis to be meaningful in real applications,
however, it is of paramount importance to choose an appropriate model structure
and to infer the model parameters from measured data. While many parameter inference
methods are available for models based on deterministic ordinary differential
equations, the same does not hold for more detailed individual-based models. Here
we consider, in particular, stochastic models in which the time evolution of the
species abundances is described by a continuous-time Markov chain. These models
are governed by a master equation that is typically difficult to solve. Consequently,
traditional inference methods that rely on iterative evaluation of parameter likelihoods
are computationally intractable. The aim of this paper is to present recent advances
in parameter inference for continuous-time Markov chain models, based on a moment
closure approximation of the parameter likelihood, and to investigate how these
results can help in understanding, and ultimately controlling, complex systems
in ecology. Specifically, we illustrate through an agricultural pest case study
how parameters of a stochastic individual-based model can be identified from measured
data and how the resulting model can be used to solve an optimal control problem
in a stochastic setting. In particular, we show how the matter of determining
the optimal combination of two different pest control methods can be formulated
as a chance constrained optimization problem where the control action is modeled
as a state reset, leading to a hybrid system formulation.
acknowledgement: "The authors would like to acknowledge contributions from Baptiste
Mottet who performed preliminary analysis regarding parameter inference for the
considered case study in a student project (Mottet, 2014/2015).\r\nThe research
leading to these results has received funding from the People Programme (Marie Curie
Actions) of the European Union's Seventh Framework Programme (FP7/2007-2013) under
REA grant agreement No. [291734] and from SystemsX under the project SignalX."
article_number: '42'
article_processing_charge: No
article_type: original
author:
- first_name: Francesca
full_name: Parise, Francesca
last_name: Parise
- first_name: John
full_name: Lygeros, John
last_name: Lygeros
- first_name: Jakob
full_name: Ruess, Jakob
id: 4A245D00-F248-11E8-B48F-1D18A9856A87
last_name: Ruess
orcid: 0000-0003-1615-3282
citation:
ama: 'Parise F, Lygeros J, Ruess J. Bayesian inference for stochastic individual-based
models of ecological systems: a pest control simulation study. Frontiers in
Environmental Science. 2015;3. doi:10.3389/fenvs.2015.00042'
apa: 'Parise, F., Lygeros, J., & Ruess, J. (2015). Bayesian inference for stochastic
individual-based models of ecological systems: a pest control simulation study.
Frontiers in Environmental Science. Frontiers. https://doi.org/10.3389/fenvs.2015.00042'
chicago: 'Parise, Francesca, John Lygeros, and Jakob Ruess. “Bayesian Inference
for Stochastic Individual-Based Models of Ecological Systems: A Pest Control Simulation
Study.” Frontiers in Environmental Science. Frontiers, 2015. https://doi.org/10.3389/fenvs.2015.00042.'
ieee: 'F. Parise, J. Lygeros, and J. Ruess, “Bayesian inference for stochastic individual-based
models of ecological systems: a pest control simulation study,” Frontiers in
Environmental Science, vol. 3. Frontiers, 2015.'
ista: 'Parise F, Lygeros J, Ruess J. 2015. Bayesian inference for stochastic individual-based
models of ecological systems: a pest control simulation study. Frontiers in Environmental
Science. 3, 42.'
mla: 'Parise, Francesca, et al. “Bayesian Inference for Stochastic Individual-Based
Models of Ecological Systems: A Pest Control Simulation Study.” Frontiers in
Environmental Science, vol. 3, 42, Frontiers, 2015, doi:10.3389/fenvs.2015.00042.'
short: F. Parise, J. Lygeros, J. Ruess, Frontiers in Environmental Science 3 (2015).
date_created: 2022-02-25T11:42:25Z
date_published: 2015-06-10T00:00:00Z
date_updated: 2022-02-25T11:59:23Z
day: '10'
ddc:
- '000'
- '570'
department:
- _id: ToHe
- _id: GaTk
doi: 10.3389/fenvs.2015.00042
ec_funded: 1
file:
- access_level: open_access
checksum: 26c222487564e1be02a11d688d6f769d
content_type: application/pdf
creator: dernst
date_created: 2022-02-25T11:55:26Z
date_updated: 2022-02-25T11:55:26Z
file_id: '10795'
file_name: 2015_FrontiersEnvironmScience_Parise.pdf
file_size: 1371201
relation: main_file
success: 1
file_date_updated: 2022-02-25T11:55:26Z
has_accepted_license: '1'
intvolume: ' 3'
keyword:
- General Environmental Science
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 25681D80-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '291734'
name: International IST Postdoc Fellowship Programme
publication: Frontiers in Environmental Science
publication_identifier:
issn:
- 2296-665X
publication_status: published
publisher: Frontiers
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Bayesian inference for stochastic individual-based models of ecological systems:
a pest control simulation study'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3
year: '2015'
...
---
_id: '10796'
abstract:
- lang: eng
text: 'We consider concurrent mean-payoff games, a very well-studied class of two-player
(player 1 vs player 2) zero-sum games on finite-state graphs where every transition
is assigned a reward between 0 and 1, and the payoff function is the long-run
average of the rewards. The value is the maximal expected payoff that player 1
can guarantee against all strategies of player 2. We consider the computation
of the set of states with value 1 under finite-memory strategies for player 1,
and our main results for the problem are as follows: (1) we present a polynomial-time
algorithm; (2) we show that whenever there is a finite-memory strategy, there
is a stationary strategy that does not need memory at all; and (3) we present
an optimal bound (which is double exponential) on the patience of stationary strategies
(where patience of a distribution is the inverse of the smallest positive probability
and represents a complexity measure of a stationary strategy).'
acknowledgement: "The research was partly supported by FWF Grant No P 23499-N23, FWF
NFN Grant\r\nNo S11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft
faculty fellows award."
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Rasmus
full_name: Ibsen-Jensen, Rasmus
id: 3B699956-F248-11E8-B48F-1D18A9856A87
last_name: Ibsen-Jensen
orcid: 0000-0003-4783-0389
citation:
ama: 'Chatterjee K, Ibsen-Jensen R. The value 1 problem under finite-memory strategies
for concurrent mean-payoff games. In: Proceedings of the Twenty-Sixth Annual
ACM-SIAM Symposium on Discrete Algorithms. Vol 2015. SIAM; 2015:1018-1029.
doi:10.1137/1.9781611973730.69'
apa: 'Chatterjee, K., & Ibsen-Jensen, R. (2015). The value 1 problem under finite-memory
strategies for concurrent mean-payoff games. In Proceedings of the Twenty-Sixth
Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 2015, pp. 1018–1029).
San Diego, CA, United States: SIAM. https://doi.org/10.1137/1.9781611973730.69'
chicago: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under
Finite-Memory Strategies for Concurrent Mean-Payoff Games.” In Proceedings
of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015:1018–29.
SIAM, 2015. https://doi.org/10.1137/1.9781611973730.69.
ieee: K. Chatterjee and R. Ibsen-Jensen, “The value 1 problem under finite-memory
strategies for concurrent mean-payoff games,” in Proceedings of the Twenty-Sixth
Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States,
2015, vol. 2015, no. 1, pp. 1018–1029.
ista: 'Chatterjee K, Ibsen-Jensen R. 2015. The value 1 problem under finite-memory
strategies for concurrent mean-payoff games. Proceedings of the Twenty-Sixth Annual
ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms
vol. 2015, 1018–1029.'
mla: Chatterjee, Krishnendu, and Rasmus Ibsen-Jensen. “The Value 1 Problem under
Finite-Memory Strategies for Concurrent Mean-Payoff Games.” Proceedings of
the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, vol. 2015,
no. 1, SIAM, 2015, pp. 1018–29, doi:10.1137/1.9781611973730.69.
short: K. Chatterjee, R. Ibsen-Jensen, in:, Proceedings of the Twenty-Sixth Annual
ACM-SIAM Symposium on Discrete Algorithms, SIAM, 2015, pp. 1018–1029.
conference:
end_date: 2015-01-06
location: San Diego, CA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2015-01-04
date_created: 2022-02-25T12:18:43Z
date_published: 2015-01-01T00:00:00Z
date_updated: 2022-02-25T12:33:32Z
day: '01'
department:
- _id: KrCh
doi: 10.1137/1.9781611973730.69
ec_funded: 1
external_id:
arxiv:
- '1409.6690'
intvolume: ' 2015'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: Preprint
page: 1018-1029
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete
Algorithms
publication_identifier:
isbn:
- 978-161197374-7
publication_status: published
publisher: SIAM
quality_controlled: '1'
scopus_import: '1'
status: public
title: The value 1 problem under finite-memory strategies for concurrent mean-payoff
games
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2015
year: '2015'
...
---
_id: '9532'
abstract:
- lang: eng
text: Genomic imprinting, an inherently epigenetic phenomenon defined by parent
of origin-dependent gene expression, is observed in mammals and flowering plants.
Genome-scale surveys of imprinted expression and the underlying differential epigenetic
marks have led to the discovery of hundreds of imprinted plant genes and confirmed
DNA and histone methylation as key regulators of plant imprinting. However, the
biological roles of the vast majority of imprinted plant genes are unknown, and
the evolutionary forces shaping plant imprinting remain rather opaque. Here, we
review the mechanisms of plant genomic imprinting and discuss theories of imprinting
evolution and biological significance in light of recent findings.
article_processing_charge: No
article_type: review
author:
- first_name: Jessica A.
full_name: Rodrigues, Jessica A.
last_name: Rodrigues
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Rodrigues JA, Zilberman D. Evolution and function of genomic imprinting in
plants. Genes and Development. 2015;29(24):2517–2531. doi:10.1101/gad.269902.115
apa: Rodrigues, J. A., & Zilberman, D. (2015). Evolution and function of genomic
imprinting in plants. Genes and Development. Cold Spring Harbor Laboratory
Press. https://doi.org/10.1101/gad.269902.115
chicago: Rodrigues, Jessica A., and Daniel Zilberman. “Evolution and Function of
Genomic Imprinting in Plants.” Genes and Development. Cold Spring Harbor
Laboratory Press, 2015. https://doi.org/10.1101/gad.269902.115.
ieee: J. A. Rodrigues and D. Zilberman, “Evolution and function of genomic imprinting
in plants,” Genes and Development, vol. 29, no. 24. Cold Spring Harbor
Laboratory Press, pp. 2517–2531, 2015.
ista: Rodrigues JA, Zilberman D. 2015. Evolution and function of genomic imprinting
in plants. Genes and Development. 29(24), 2517–2531.
mla: Rodrigues, Jessica A., and Daniel Zilberman. “Evolution and Function of Genomic
Imprinting in Plants.” Genes and Development, vol. 29, no. 24, Cold Spring
Harbor Laboratory Press, 2015, pp. 2517–2531, doi:10.1101/gad.269902.115.
short: J.A. Rodrigues, D. Zilberman, Genes and Development 29 (2015) 2517–2531.
date_created: 2021-06-08T09:56:24Z
date_published: 2015-12-15T00:00:00Z
date_updated: 2021-12-14T07:58:15Z
day: '15'
ddc:
- '570'
department:
- _id: DaZi
doi: 10.1101/gad.269902.115
extern: '1'
external_id:
pmid:
- '26680300'
file:
- access_level: open_access
checksum: 086a88cfca4677646da26ed960cb02e9
content_type: application/pdf
creator: asandaue
date_created: 2021-06-08T09:55:10Z
date_updated: 2021-06-08T09:55:10Z
file_id: '9533'
file_name: 2015_GenesAndDevelopment_Rodrigues.pdf
file_size: 1116846
relation: main_file
success: 1
file_date_updated: 2021-06-08T09:55:10Z
has_accepted_license: '1'
intvolume: ' 29'
issue: '24'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '12'
oa: 1
oa_version: Published Version
page: 2517–2531
pmid: 1
publication: Genes and Development
publication_identifier:
eissn:
- 1549-5477
issn:
- 0890-9369
publication_status: published
publisher: Cold Spring Harbor Laboratory Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evolution and function of genomic imprinting in plants
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 29
year: '2015'
...
---
_id: '9711'
article_processing_charge: No
author:
- first_name: Guillaume
full_name: Chevereau, Guillaume
id: 424D78A0-F248-11E8-B48F-1D18A9856A87
last_name: Chevereau
- first_name: Marta
full_name: Lukacisinova, Marta
id: 4342E402-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisinova
orcid: 0000-0002-2519-8004
- first_name: Tugce
full_name: Batur, Tugce
last_name: Batur
- first_name: Aysegul
full_name: Guvenek, Aysegul
last_name: Guvenek
- first_name: Dilay Hazal
full_name: Ayhan, Dilay Hazal
last_name: Ayhan
- first_name: Erdal
full_name: Toprak, Erdal
last_name: Toprak
- first_name: Mark Tobias
full_name: Bollenbach, Mark Tobias
id: 3E6DB97A-F248-11E8-B48F-1D18A9856A87
last_name: Bollenbach
orcid: 0000-0003-4398-476X
citation:
ama: Chevereau G, Lukacisinova M, Batur T, et al. Excel file containing the raw
data for all figures. 2015. doi:10.1371/journal.pbio.1002299.s001
apa: Chevereau, G., Lukacisinova, M., Batur, T., Guvenek, A., Ayhan, D. H., Toprak,
E., & Bollenbach, M. T. (2015). Excel file containing the raw data for all
figures. Public Library of Science. https://doi.org/10.1371/journal.pbio.1002299.s001
chicago: Chevereau, Guillaume, Marta Lukacisinova, Tugce Batur, Aysegul Guvenek,
Dilay Hazal Ayhan, Erdal Toprak, and Mark Tobias Bollenbach. “Excel File Containing
the Raw Data for All Figures.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pbio.1002299.s001.
ieee: G. Chevereau et al., “Excel file containing the raw data for all figures.”
Public Library of Science, 2015.
ista: Chevereau G, Lukacisinova M, Batur T, Guvenek A, Ayhan DH, Toprak E, Bollenbach
MT. 2015. Excel file containing the raw data for all figures, Public Library of
Science, 10.1371/journal.pbio.1002299.s001.
mla: Chevereau, Guillaume, et al. Excel File Containing the Raw Data for All
Figures. Public Library of Science, 2015, doi:10.1371/journal.pbio.1002299.s001.
short: G. Chevereau, M. Lukacisinova, T. Batur, A. Guvenek, D.H. Ayhan, E. Toprak,
M.T. Bollenbach, (2015).
date_created: 2021-07-23T11:53:50Z
date_published: 2015-11-18T00:00:00Z
date_updated: 2023-02-23T10:07:02Z
day: '18'
department:
- _id: ToBo
doi: 10.1371/journal.pbio.1002299.s001
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1619'
relation: used_in_publication
status: public
status: public
title: Excel file containing the raw data for all figures
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9712'
article_processing_charge: No
author:
- first_name: Murat
full_name: Tugrul, Murat
id: 37C323C6-F248-11E8-B48F-1D18A9856A87
last_name: Tugrul
orcid: 0000-0002-8523-0758
- first_name: Tiago
full_name: Paixao, Tiago
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Nicholas H
full_name: Barton, Nicholas H
id: 4880FE40-F248-11E8-B48F-1D18A9856A87
last_name: Barton
orcid: 0000-0002-8548-5240
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Tugrul M, Paixao T, Barton NH, Tkačik G. Other fitness models for comparison
& for interacting TFBSs. 2015. doi:10.1371/journal.pgen.1005639.s001
apa: Tugrul, M., Paixao, T., Barton, N. H., & Tkačik, G. (2015). Other fitness
models for comparison & for interacting TFBSs. Public Library of Science.
https://doi.org/10.1371/journal.pgen.1005639.s001
chicago: Tugrul, Murat, Tiago Paixao, Nicholas H Barton, and Gašper Tkačik. “Other
Fitness Models for Comparison & for Interacting TFBSs.” Public Library of
Science, 2015. https://doi.org/10.1371/journal.pgen.1005639.s001.
ieee: M. Tugrul, T. Paixao, N. H. Barton, and G. Tkačik, “Other fitness models for
comparison & for interacting TFBSs.” Public Library of Science, 2015.
ista: Tugrul M, Paixao T, Barton NH, Tkačik G. 2015. Other fitness models for comparison
& for interacting TFBSs, Public Library of Science, 10.1371/journal.pgen.1005639.s001.
mla: Tugrul, Murat, et al. Other Fitness Models for Comparison & for Interacting
TFBSs. Public Library of Science, 2015, doi:10.1371/journal.pgen.1005639.s001.
short: M. Tugrul, T. Paixao, N.H. Barton, G. Tkačik, (2015).
date_created: 2021-07-23T12:00:37Z
date_published: 2015-11-06T00:00:00Z
date_updated: 2025-05-28T11:57:04Z
day: '06'
department:
- _id: NiBa
- _id: CaGu
- _id: GaTk
doi: 10.1371/journal.pgen.1005639.s001
month: '11'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1666'
relation: used_in_publication
status: public
status: public
title: Other fitness models for comparison & for interacting TFBSs
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9714'
article_processing_charge: No
author:
- first_name: Àngel
full_name: Gómez Sicilia, Àngel
last_name: Gómez Sicilia
- first_name: Mateusz K
full_name: Sikora, Mateusz K
id: 2F74BCDE-F248-11E8-B48F-1D18A9856A87
last_name: Sikora
- first_name: Marek
full_name: Cieplak, Marek
last_name: Cieplak
- first_name: Mariano
full_name: Carrión Vázquez, Mariano
last_name: Carrión Vázquez
citation:
ama: Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. An exploration of
the universe of polyglutamine structures - submission to PLOS journals. 2015.
doi:10.1371/journal.pcbi.1004541.s001
apa: Gómez Sicilia, À., Sikora, M. K., Cieplak, M., & Carrión Vázquez, M. (2015).
An exploration of the universe of polyglutamine structures - submission to PLOS
journals. Public Library of Science . https://doi.org/10.1371/journal.pcbi.1004541.s001
chicago: Gómez Sicilia, Àngel, Mateusz K Sikora, Marek Cieplak, and Mariano Carrión
Vázquez. “An Exploration of the Universe of Polyglutamine Structures - Submission
to PLOS Journals.” Public Library of Science , 2015. https://doi.org/10.1371/journal.pcbi.1004541.s001.
ieee: À. Gómez Sicilia, M. K. Sikora, M. Cieplak, and M. Carrión Vázquez, “An exploration
of the universe of polyglutamine structures - submission to PLOS journals.” Public
Library of Science , 2015.
ista: Gómez Sicilia À, Sikora MK, Cieplak M, Carrión Vázquez M. 2015. An exploration
of the universe of polyglutamine structures - submission to PLOS journals, Public
Library of Science , 10.1371/journal.pcbi.1004541.s001.
mla: Gómez Sicilia, Àngel, et al. An Exploration of the Universe of Polyglutamine
Structures - Submission to PLOS Journals. Public Library of Science , 2015,
doi:10.1371/journal.pcbi.1004541.s001.
short: À. Gómez Sicilia, M.K. Sikora, M. Cieplak, M. Carrión Vázquez, (2015).
date_created: 2021-07-23T12:05:28Z
date_published: 2015-10-23T00:00:00Z
date_updated: 2023-02-23T10:04:35Z
day: '23'
department:
- _id: CaHe
doi: 10.1371/journal.pcbi.1004541.s001
month: '10'
oa_version: Published Version
publisher: 'Public Library of Science '
related_material:
record:
- id: '1566'
relation: used_in_publication
status: public
status: public
title: An exploration of the universe of polyglutamine structures - submission to
PLOS journals
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9715'
article_processing_charge: No
author:
- first_name: Barbora
full_name: Trubenova, Barbora
id: 42302D54-F248-11E8-B48F-1D18A9856A87
last_name: Trubenova
orcid: 0000-0002-6873-2967
- first_name: Sebastian
full_name: Novak, Sebastian
id: 461468AE-F248-11E8-B48F-1D18A9856A87
last_name: Novak
- first_name: Reinmar
full_name: Hager, Reinmar
last_name: Hager
citation:
ama: Trubenova B, Novak S, Hager R. Mathematical inference of the results. 2015.
doi:10.1371/journal.pone.0126907.s001
apa: Trubenova, B., Novak, S., & Hager, R. (2015). Mathematical inference of
the results. Public Library of Science. https://doi.org/10.1371/journal.pone.0126907.s001
chicago: Trubenova, Barbora, Sebastian Novak, and Reinmar Hager. “Mathematical Inference
of the Results.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pone.0126907.s001.
ieee: B. Trubenova, S. Novak, and R. Hager, “Mathematical inference of the results.”
Public Library of Science, 2015.
ista: Trubenova B, Novak S, Hager R. 2015. Mathematical inference of the results,
Public Library of Science, 10.1371/journal.pone.0126907.s001.
mla: Trubenova, Barbora, et al. Mathematical Inference of the Results. Public
Library of Science, 2015, doi:10.1371/journal.pone.0126907.s001.
short: B. Trubenova, S. Novak, R. Hager, (2015).
date_created: 2021-07-23T12:11:30Z
date_published: 2015-05-18T00:00:00Z
date_updated: 2023-02-23T10:15:25Z
day: '18'
department:
- _id: NiBa
doi: 10.1371/journal.pone.0126907.s001
month: '05'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1809'
relation: used_in_publication
status: public
status: public
title: Mathematical inference of the results
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9718'
article_processing_charge: No
author:
- first_name: Tamar
full_name: Friedlander, Tamar
id: 36A5845C-F248-11E8-B48F-1D18A9856A87
last_name: Friedlander
- first_name: Avraham E.
full_name: Mayo, Avraham E.
last_name: Mayo
- first_name: Tsvi
full_name: Tlusty, Tsvi
last_name: Tlusty
- first_name: Uri
full_name: Alon, Uri
last_name: Alon
citation:
ama: Friedlander T, Mayo AE, Tlusty T, Alon U. Supporting information text. 2015.
doi:10.1371/journal.pcbi.1004055.s001
apa: Friedlander, T., Mayo, A. E., Tlusty, T., & Alon, U. (2015). Supporting
information text. Public Library of Science. https://doi.org/10.1371/journal.pcbi.1004055.s001
chicago: Friedlander, Tamar, Avraham E. Mayo, Tsvi Tlusty, and Uri Alon. “Supporting
Information Text.” Public Library of Science, 2015. https://doi.org/10.1371/journal.pcbi.1004055.s001.
ieee: T. Friedlander, A. E. Mayo, T. Tlusty, and U. Alon, “Supporting information
text.” Public Library of Science, 2015.
ista: Friedlander T, Mayo AE, Tlusty T, Alon U. 2015. Supporting information text,
Public Library of Science, 10.1371/journal.pcbi.1004055.s001.
mla: Friedlander, Tamar, et al. Supporting Information Text. Public Library
of Science, 2015, doi:10.1371/journal.pcbi.1004055.s001.
short: T. Friedlander, A.E. Mayo, T. Tlusty, U. Alon, (2015).
date_created: 2021-07-26T08:35:23Z
date_published: 2015-03-23T00:00:00Z
date_updated: 2023-02-23T10:16:13Z
day: '23'
department:
- _id: GaTk
doi: 10.1371/journal.pcbi.1004055.s001
month: '03'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1827'
relation: used_in_publication
status: public
status: public
title: Supporting information text
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9719'
abstract:
- lang: eng
text: Parasitism creates selection for resistance mechanisms in host populations
and is hypothesized to promote increased host evolvability. However, the influence
of these traits on host evolution when parasites are no longer present is unclear.
We used experimental evolution and whole-genome sequencing of Escherichia coli
to determine the effects of past and present exposure to parasitic viruses (phages)
on the spread of mutator alleles, resistance, and bacterial competitive fitness.
We found that mutator alleles spread rapidly during adaptation to any of four
different phage species, and this pattern was even more pronounced with multiple
phages present simultaneously. However, hypermutability did not detectably accelerate
adaptation in the absence of phages and recovery of fitness costs associated with
resistance. Several lineages evolved phage resistance through elevated mucoidy,
and during subsequent evolution in phage-free conditions they rapidly reverted
to nonmucoid, phage-susceptible phenotypes. Genome sequencing revealed that this
phenotypic reversion was achieved by additional genetic changes rather than by
genotypic reversion of the initial resistance mutations. Insertion sequence (IS)
elements played a key role in both the acquisition of resistance and adaptation
in the absence of parasites; unlike single nucleotide polymorphisms, IS insertions
were not more frequent in mutator lineages. Our results provide a genetic explanation
for rapid reversion of mucoidy, a phenotype observed in other bacterial species
including human pathogens. Moreover, this demonstrates that the types of genetic
change underlying adaptation to fitness costs, and consequently the impact of
evolvability mechanisms such as increased point-mutation rates, depend critically
on the mechanism of resistance.
article_processing_charge: No
author:
- first_name: Sébastien
full_name: Wielgoss, Sébastien
last_name: Wielgoss
- first_name: Tobias
full_name: Bergmiller, Tobias
id: 2C471CFA-F248-11E8-B48F-1D18A9856A87
last_name: Bergmiller
orcid: 0000-0001-5396-4346
- first_name: Anna M.
full_name: Bischofberger, Anna M.
last_name: Bischofberger
- first_name: Alex R.
full_name: Hall, Alex R.
last_name: Hall
citation:
ama: 'Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. Data from: Adaptation
to parasites and costs of parasite resistance in mutator and non-mutator bacteria.
2015. doi:10.5061/dryad.cj910'
apa: 'Wielgoss, S., Bergmiller, T., Bischofberger, A. M., & Hall, A. R. (2015).
Data from: Adaptation to parasites and costs of parasite resistance in mutator
and non-mutator bacteria. Dryad. https://doi.org/10.5061/dryad.cj910'
chicago: 'Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex
R. Hall. “Data from: Adaptation to Parasites and Costs of Parasite Resistance
in Mutator and Non-Mutator Bacteria.” Dryad, 2015. https://doi.org/10.5061/dryad.cj910.'
ieee: 'S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Data from:
Adaptation to parasites and costs of parasite resistance in mutator and non-mutator
bacteria.” Dryad, 2015.'
ista: 'Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2015. Data from: Adaptation
to parasites and costs of parasite resistance in mutator and non-mutator bacteria,
Dryad, 10.5061/dryad.cj910.'
mla: 'Wielgoss, Sébastien, et al. Data from: Adaptation to Parasites and Costs
of Parasite Resistance in Mutator and Non-Mutator Bacteria. Dryad, 2015, doi:10.5061/dryad.cj910.'
short: S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, (2015).
date_created: 2021-07-26T08:44:04Z
date_published: 2015-12-21T00:00:00Z
date_updated: 2023-09-05T13:46:04Z
day: '21'
department:
- _id: CaGu
doi: 10.5061/dryad.cj910
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.cj910
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '5749'
relation: used_in_publication
status: public
status: public
title: 'Data from: Adaptation to parasites and costs of parasite resistance in mutator
and non-mutator bacteria'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9721'
abstract:
- lang: eng
text: To prevent epidemics, insect societies have evolved collective disease defences
that are highly effective at curing exposed individuals and limiting disease transmission
to healthy group members. Grooming is an important sanitary behaviour—either performed
towards oneself (self-grooming) or towards others (allogrooming)—to remove infectious
agents from the body surface of exposed individuals, but at the risk of disease
contraction by the groomer. We use garden ants (Lasius neglectus) and the fungal
pathogen Metarhizium as a model system to study how pathogen presence affects
self-grooming and allogrooming between exposed and healthy individuals. We develop
an epidemiological SIS model to explore how experimentally observed grooming patterns
affect disease spread within the colony, thereby providing a direct link between
the expression and direction of sanitary behaviours, and their effects on colony-level
epidemiology. We find that fungus-exposed ants increase self-grooming, while simultaneously
decreasing allogrooming. This behavioural modulation seems universally adaptive
and is predicted to contain disease spread in a great variety of host–pathogen
systems. In contrast, allogrooming directed towards pathogen-exposed individuals
might both increase and decrease disease risk. Our model reveals that the effect
of allogrooming depends on the balance between pathogen infectiousness and efficiency
of social host defences, which are likely to vary across host–pathogen systems.
article_processing_charge: No
author:
- first_name: Fabian
full_name: Theis, Fabian
last_name: Theis
- first_name: Line V
full_name: Ugelvig, Line V
id: 3DC97C8E-F248-11E8-B48F-1D18A9856A87
last_name: Ugelvig
orcid: 0000-0003-1832-8883
- first_name: Carsten
full_name: Marr, Carsten
last_name: Marr
- first_name: Sylvia
full_name: Cremer, Sylvia
id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87
last_name: Cremer
orcid: 0000-0002-2193-3868
citation:
ama: 'Theis F, Ugelvig LV, Marr C, Cremer S. Data from: Opposing effects of allogrooming
on disease transmission in ant societies. 2015. doi:10.5061/dryad.dj2bf'
apa: 'Theis, F., Ugelvig, L. V., Marr, C., & Cremer, S. (2015). Data from: Opposing
effects of allogrooming on disease transmission in ant societies. Dryad. https://doi.org/10.5061/dryad.dj2bf'
chicago: 'Theis, Fabian, Line V Ugelvig, Carsten Marr, and Sylvia Cremer. “Data
from: Opposing Effects of Allogrooming on Disease Transmission in Ant Societies.”
Dryad, 2015. https://doi.org/10.5061/dryad.dj2bf.'
ieee: 'F. Theis, L. V. Ugelvig, C. Marr, and S. Cremer, “Data from: Opposing effects
of allogrooming on disease transmission in ant societies.” Dryad, 2015.'
ista: 'Theis F, Ugelvig LV, Marr C, Cremer S. 2015. Data from: Opposing effects
of allogrooming on disease transmission in ant societies, Dryad, 10.5061/dryad.dj2bf.'
mla: 'Theis, Fabian, et al. Data from: Opposing Effects of Allogrooming on Disease
Transmission in Ant Societies. Dryad, 2015, doi:10.5061/dryad.dj2bf.'
short: F. Theis, L.V. Ugelvig, C. Marr, S. Cremer, (2015).
date_created: 2021-07-26T09:38:36Z
date_published: 2015-12-29T00:00:00Z
date_updated: 2023-02-23T10:16:22Z
day: '29'
department:
- _id: SyCr
doi: 10.5061/dryad.dj2bf
main_file_link:
- open_access: '1'
url: https://doi.org/10.5061/dryad.dj2bf
month: '12'
oa: 1
oa_version: Published Version
publisher: Dryad
related_material:
record:
- id: '1830'
relation: used_in_publication
status: public
status: public
title: 'Data from: Opposing effects of allogrooming on disease transmission in ant
societies'
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...
---
_id: '9737'
article_processing_charge: No
author:
- first_name: Olga
full_name: Symonova, Olga
id: 3C0C7BC6-F248-11E8-B48F-1D18A9856A87
last_name: Symonova
- first_name: Christopher
full_name: Topp, Christopher
last_name: Topp
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: Symonova O, Topp C, Edelsbrunner H. Root traits computed by DynamicRoots for
the maize root shown in fig 2. 2015. doi:10.1371/journal.pone.0127657.s001
apa: Symonova, O., Topp, C., & Edelsbrunner, H. (2015). Root traits computed
by DynamicRoots for the maize root shown in fig 2. Public Library of Science.
https://doi.org/10.1371/journal.pone.0127657.s001
chicago: Symonova, Olga, Christopher Topp, and Herbert Edelsbrunner. “Root Traits
Computed by DynamicRoots for the Maize Root Shown in Fig 2.” Public Library of
Science, 2015. https://doi.org/10.1371/journal.pone.0127657.s001.
ieee: O. Symonova, C. Topp, and H. Edelsbrunner, “Root traits computed by DynamicRoots
for the maize root shown in fig 2.” Public Library of Science, 2015.
ista: Symonova O, Topp C, Edelsbrunner H. 2015. Root traits computed by DynamicRoots
for the maize root shown in fig 2, Public Library of Science, 10.1371/journal.pone.0127657.s001.
mla: Symonova, Olga, et al. Root Traits Computed by DynamicRoots for the Maize
Root Shown in Fig 2. Public Library of Science, 2015, doi:10.1371/journal.pone.0127657.s001.
short: O. Symonova, C. Topp, H. Edelsbrunner, (2015).
date_created: 2021-07-28T06:20:13Z
date_published: 2015-06-01T00:00:00Z
date_updated: 2023-02-23T10:14:42Z
day: '01'
department:
- _id: MaJö
- _id: HeEd
doi: 10.1371/journal.pone.0127657.s001
month: '06'
oa_version: Published Version
publisher: Public Library of Science
related_material:
record:
- id: '1793'
relation: used_in_publication
status: public
status: public
title: Root traits computed by DynamicRoots for the maize root shown in fig 2
type: research_data_reference
user_id: 6785fbc1-c503-11eb-8a32-93094b40e1cf
year: '2015'
...