---
OA_place: publisher
OA_type: free access
_id: '526'
abstract:
- lang: eng
text: Plants form new organs with patterned tissue organization throughout their
lifespan. It is unknown whether this robust post-embryonic organ formation results
from stereotypic dynamic processes, in which the arrangement of cells follows
rigid rules. Here, we combine modeling with empirical observations of whole-organ
development to identify the principles governing lateral root formation in Arabidopsis.
Lateral roots derive from a small pool of founder cells in which some take a dominant
role as seen by lineage tracing. The first division of the founders is asymmetric,
tightly regulated, and determines the formation of a layered structure. Whereas
the pattern of subsequent cell divisions is not stereotypic between different
samples, it is characterized by a regular switch in division plane orientation.
This switch is also necessary for the appearance of patterned layers as a result
of the apical growth of the primordium. Our data suggest that lateral root morphogenesis
is based on a limited set of rules. They determine cell growth and division orientation.
The organ-level coupling of the cell behavior ensures the emergence of the lateral
root's characteristic features. We propose that self-organizing, non-deterministic
modes of development account for the robustness of plant organ morphogenesis.
acknowledgement: "We thank M.J. Bennett, L. Laplaze, and S. Lemke for their helpful
comments.\r\nThis work was supported by the Land Baden-Württemberg, the Chica und
Heinz Schaller Stiftung, the CellNetworks cluster of excellence, and the Boehringer
Ingelheim Fond (to J.F. and A.M.) and the Cluster of Excellence “Macromolecular
Complexes” at the Goethe University Frankfurt am Main (CEF-MC II; DFG Project EXC
115; to D.v.W., A.S., and E.H.K.S.).\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Von Wangenheim, Daniel
id: 49E91952-F248-11E8-B48F-1D18A9856A87
last_name: Von Wangenheim
orcid: 0000-0002-6862-1247
- first_name: Jens
full_name: Fangerau, Jens
last_name: Fangerau
- first_name: Alexander
full_name: Schmitz, Alexander
last_name: Schmitz
- first_name: Richard
full_name: Smith, Richard
last_name: Smith
- first_name: Heike
full_name: Leitte, Heike
last_name: Leitte
- first_name: Ernst
full_name: Stelzer, Ernst
last_name: Stelzer
- first_name: Alexis
full_name: Maizel, Alexis
last_name: Maizel
citation:
ama: von Wangenheim D, Fangerau J, Schmitz A, et al. Rules and self-organizing properties
of post-embryonic plant organ cell division patterns. Current Biology.
2016;26(4):439-449. doi:10.1016/j.cub.2015.12.047
apa: von Wangenheim, D., Fangerau, J., Schmitz, A., Smith, R., Leitte, H., Stelzer,
E., & Maizel, A. (2016). Rules and self-organizing properties of post-embryonic
plant organ cell division patterns. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2015.12.047
chicago: Wangenheim, Daniel von, Jens Fangerau, Alexander Schmitz, Richard Smith,
Heike Leitte, Ernst Stelzer, and Alexis Maizel. “Rules and Self-Organizing Properties
of Post-Embryonic Plant Organ Cell Division Patterns.” Current Biology.
Cell Press, 2016. https://doi.org/10.1016/j.cub.2015.12.047.
ieee: D. von Wangenheim et al., “Rules and self-organizing properties of
post-embryonic plant organ cell division patterns,” Current Biology, vol.
26, no. 4. Cell Press, pp. 439–449, 2016.
ista: von Wangenheim D, Fangerau J, Schmitz A, Smith R, Leitte H, Stelzer E, Maizel
A. 2016. Rules and self-organizing properties of post-embryonic plant organ cell
division patterns. Current Biology. 26(4), 439–449.
mla: von Wangenheim, Daniel, et al. “Rules and Self-Organizing Properties of Post-Embryonic
Plant Organ Cell Division Patterns.” Current Biology, vol. 26, no. 4, Cell
Press, 2016, pp. 439–49, doi:10.1016/j.cub.2015.12.047.
short: D. von Wangenheim, J. Fangerau, A. Schmitz, R. Smith, H. Leitte, E. Stelzer,
A. Maizel, Current Biology 26 (2016) 439–449.
date_created: 2018-12-11T11:46:58Z
date_published: 2016-02-22T00:00:00Z
date_updated: 2026-06-02T09:03:03Z
day: '22'
doi: 10.1016/j.cub.2015.12.047
extern: '1'
external_id:
pmid:
- '26832441'
fulldoi: https://doi.org/10.1016/j.cub.2015.12.047
intvolume: ' 26'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cub.2015.12.047
month: '02'
oa: 1
oa_version: Published Version
page: 439 - 449
pmid: 1
publication: Current Biology
publication_identifier:
eissn:
- 1879-0445
issn:
- 0960-9822
publication_status: published
publisher: Cell Press
publist_id: '7293'
quality_controlled: '1'
status: public
title: Rules and self-organizing properties of post-embryonic plant organ cell division
patterns
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2016'
...
---
_id: '5445'
abstract:
- lang: eng
text: 'We consider the quantitative analysis problem for interprocedural control-flow
graphs (ICFGs). The input consists of an ICFG, a positive weight function that
assigns every transition a positive integer-valued number, and a labelling of
the transitions (events) as good, bad, and neutral events. The weight function
assigns to each transition a numerical value that represents ameasure of how good
or bad an event is. The quantitative analysis problem asks whether there is a
run of the ICFG where the ratio of the sum of the numerical weights of good events
versus the sum of weights of bad events in the long-run is at least a given threshold
(or equivalently, to compute the maximal ratio among all valid paths in the ICFG).
The quantitative analysis problem for ICFGs can be solved in polynomial time,
and we present an efficient and practical algorithm for the problem. We show that
several problems relevant for static program analysis, such as estimating the
worst-case execution time of a program or the average energy consumption of a
mobile application, can be modeled in our framework. We have implemented our algorithm
as a tool in the Java Soot framework. We demonstrate the effectiveness of our
approach with two case studies. First, we show that our framework provides a sound
approach (no false positives) for the analysis of inefficiently-used containers.
Second, we show that our approach can also be used for static profiling of programs
which reasons about methods that are frequently invoked. Our experimental results
show that our tool scales to relatively large benchmarks, and discovers relevant
and useful information that can be used to optimize performance of the programs. '
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: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Yaron
full_name: Velner, Yaron
last_name: Velner
citation:
ama: Chatterjee K, Pavlogiannis A, Velner Y. Quantitative Interprocedural Analysis.
IST Austria; 2016. doi:10.15479/AT:IST-2016-523-v1-1
apa: Chatterjee, K., Pavlogiannis, A., & Velner, Y. (2016). Quantitative
interprocedural analysis. IST Austria. https://doi.org/10.15479/AT:IST-2016-523-v1-1
chicago: Chatterjee, Krishnendu, Andreas Pavlogiannis, and Yaron Velner. Quantitative
Interprocedural Analysis. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-523-v1-1.
ieee: K. Chatterjee, A. Pavlogiannis, and Y. Velner, Quantitative interprocedural
analysis. IST Austria, 2016.
ista: Chatterjee K, Pavlogiannis A, Velner Y. 2016. Quantitative interprocedural
analysis, IST Austria, 33p.
mla: Chatterjee, Krishnendu, et al. Quantitative Interprocedural Analysis.
IST Austria, 2016, doi:10.15479/AT:IST-2016-523-v1-1.
short: K. Chatterjee, A. Pavlogiannis, Y. Velner, Quantitative Interprocedural Analysis,
IST Austria, 2016.
date_created: 2018-12-12T11:39:22Z
date_published: 2016-03-31T00:00:00Z
date_updated: 2025-04-15T08:11:41Z
day: '31'
ddc:
- '005'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-523-v1-1
file:
- access_level: open_access
checksum: cef516fa091925b5868813e355268fb4
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:52Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5513'
file_name: IST-2016-523-v1+1_main.pdf
file_size: 1012204
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
fulldoi: https://doi.org/10.15479/AT:IST-2016-523-v1-1
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '33'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '523'
related_material:
record:
- id: '1604'
relation: later_version
status: public
status: public
title: Quantitative interprocedural analysis
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5446'
abstract:
- lang: eng
text: "We study the problem of developing efficient approaches for proving termination
of recursive programs with one-dimensional arrays. Ranking functions serve as
a sound and complete approach for proving termination of non-recursive programs
without array operations. First, we generalize ranking functions to the notion
of measure functions, and prove that measure functions (i) provide a sound method
to prove termination of recursive programs (with one-dimensional arrays), and
(ii) is both sound and complete over recursive programs without array operations.
Our second contribution is the synthesis of measure functions of specific forms
in polynomial time. More precisely, we prove that (i) polynomial measure functions
over recursive programs can be synthesized in polynomial time through Farkas’
Lemma and Handelman’s Theorem, and (ii) measure functions involving logarithm
and exponentiation can be synthesized in polynomial time through abstraction of
logarithmic or exponential terms and Handelman’s Theorem. A key application of
our method is the worst-case analysis of recursive programs. While previous methods
obtain worst-case polynomial bounds of the form O(n^k), where k is an integer,
our polynomial time methods can synthesize bounds of the form O(n log n), as well
as O(n^x), where x is not an integer. We show the applicability of our automated
technique to obtain worst-case complexity of classical recursive algorithms such
as (i) Merge-Sort, the divideand-\r\nconquer algorithm for the Closest-Pair problem,
where we obtain O(n log n) worst-case bound, and (ii) Karatsuba’s algorithm for
polynomial multiplication and Strassen’s algorithm for matrix multiplication,
where we obtain O(n^x) bound, where x is not an integer and close to the best-known
bounds for the respective algorithms. Finally, we present experimental results
to demonstrate the\r\neffectiveness of our approach."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3. Termination and Worst-Case Analysis
of Recursive Programs. IST Austria; 2016.
apa: Anonymous, 1, Anonymous, 2, & Anonymous, 3. (2016). Termination and
worst-case analysis of recursive programs. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, and 3 Anonymous. Termination and Worst-Case
Analysis of Recursive Programs. IST Austria, 2016.
ieee: 1 Anonymous, 2 Anonymous, and 3 Anonymous, Termination and worst-case analysis
of recursive programs. IST Austria, 2016.
ista: Anonymous 1, Anonymous 2, Anonymous 3. 2016. Termination and worst-case analysis
of recursive programs, IST Austria, 26p.
mla: Anonymous, 1, et al. Termination and Worst-Case Analysis of Recursive Programs.
IST Austria, 2016.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, Termination and Worst-Case Analysis
of Recursive Programs, IST Austria, 2016.
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2020-07-14T23:05:05Z
day: '15'
ddc:
- '000'
file:
- access_level: open_access
checksum: 689069a7abbb34b21516164cbee9e0df
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T13:27:24Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6403'
file_name: popl2017a.pdf
file_size: 686241
relation: main_file
- access_level: closed
checksum: fc08022bfbaac07bac047a9407c0bbb3
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:27:31Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6404'
file_name: author_names.txt
file_size: 258
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '26'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '618'
status: public
title: Termination and worst-case analysis of recursive programs
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5447'
abstract:
- lang: eng
text: "We consider the problem of developing automated techniques to aid the average-case
complexity analysis of programs. Several classical textbook algorithms have quite
efficient average-case complexity, whereas the corresponding worst-case bounds
are either inefficient (e.g., QUICK-SORT), or completely ineffective (e.g., COUPONCOLLECTOR).
Since the main focus of average-case analysis is to obtain efficient bounds, we
consider bounds that are either logarithmic,\r\nlinear, or almost-linear (O(log
n), O(n), O(n · log n),\r\nrespectively, where n represents the size of the input).
Our main contribution is a sound approach for deriving such average-case bounds
for randomized recursive programs. Our approach is efficient (a simple linear-time
algorithm), and it is based on (a) the analysis of recurrence relations induced
by randomized algorithms, and (b) a guess-and-check technique. Our approach can
infer the asymptotically optimal average-case bounds for classical randomized
algorithms, including RANDOMIZED-SEARCH, QUICKSORT, QUICK-SELECT, COUPON-COLLECTOR,
where the worstcase\r\nbounds are either inefficient (such as linear as compared
to logarithmic of average-case, or quadratic as compared to linear or almost-linear
of average-case), or ineffective. We have implemented our approach, and the experimental
results show that we obtain the bounds efficiently for various classical algorithms."
alternative_title:
- IST Austria Technical Report
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: 'Anonymous 1, Anonymous 2, Anonymous 3. Average-Case Analysis of Programs:
Automated Recurrence Analysis for Almost-Linear Bounds. IST Austria; 2016.'
apa: 'Anonymous, 1, Anonymous, 2, & Anonymous, 3. (2016). Average-case analysis
of programs: Automated recurrence analysis for almost-linear bounds. IST Austria.'
chicago: 'Anonymous, 1, 2 Anonymous, and 3 Anonymous. Average-Case Analysis of
Programs: Automated Recurrence Analysis for Almost-Linear Bounds. IST Austria,
2016.'
ieee: '1 Anonymous, 2 Anonymous, and 3 Anonymous, Average-case analysis of programs:
Automated recurrence analysis for almost-linear bounds. IST Austria, 2016.'
ista: 'Anonymous 1, Anonymous 2, Anonymous 3. 2016. Average-case analysis of programs:
Automated recurrence analysis for almost-linear bounds, IST Austria, 20p.'
mla: 'Anonymous, 1, et al. Average-Case Analysis of Programs: Automated Recurrence
Analysis for Almost-Linear Bounds. IST Austria, 2016.'
short: '1 Anonymous, 2 Anonymous, 3 Anonymous, Average-Case Analysis of Programs:
Automated Recurrence Analysis for Almost-Linear Bounds, IST Austria, 2016.'
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2020-07-14T23:05:06Z
day: '15'
ddc:
- '000'
file:
- access_level: closed
checksum: cf53cdb6d092e68db0b4a0a1506ef8fb
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:32:16Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6406'
file_name: listofauthors.txt
file_size: 281
relation: main_file
- access_level: open_access
checksum: 7bdd94ba13aa0dec9c46887fcf13870b
content_type: application/pdf
creator: dernst
date_created: 2019-05-10T13:32:16Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6407'
file_name: popl2017b.pdf
file_size: 563642
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '619'
status: public
title: 'Average-case analysis of programs: Automated recurrence analysis for almost-linear
bounds'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5448'
abstract:
- lang: eng
text: "We present a new dynamic partial-order reduction method for stateless model
checking of concurrent programs. A common approach for exploring program behaviors
relies on enumerating the traces of the program, without storing the visited states
(aka stateless exploration). As the number of distinct traces grows exponentially,
dynamic partial-order reduction (DPOR) techniques have been successfully used
to partition the space of traces into equivalence classes (Mazurkiewicz partitioning),
with the goal of exploring only few representative traces from each class.\r\nWe
introduce a new equivalence on traces under sequential consistency semantics,
which we call the observation equivalence. Two traces are observationally equivalent
if every read event observes the same write event in both traces. While the traditional
Mazurkiewicz equivalence is control-centric, our new definition is data-centric.
We show that our observation equivalence is coarser than the Mazurkiewicz equivalence,
and in many cases even exponentially coarser. We devise a DPOR exploration of
the trace space, called data-centric DPOR, based on the observation equivalence.\r\n1.
For acyclic architectures, our algorithm is guaranteed to explore exactly one
representative trace from each observation class, while spending polynomial time
per class. Hence, our algorithm is optimal wrt the observation equivalence, and
in several cases explores exponentially fewer traces than any enumerative method
based on the Mazurkiewicz equivalence.\r\n2. For cyclic architectures, we consider
an equivalence between traces which is finer than the observation equivalence;
but coarser than the Mazurkiewicz equivalence, and in some cases is exponentially
coarser. Our data-centric DPOR algorithm remains optimal under this trace equivalence.
\r\nFinally, we perform a basic experimental comparison between the existing Mazurkiewicz-based
DPOR and our data-centric DPOR on a set of academic benchmarks. Our results show
a significant reduction in both running time and the number of explored equivalence
classes."
alternative_title:
- IST Austria Technical Report
arxiv: 1
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
- first_name: '4'
full_name: Anonymous, 4
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. Data-Centric Dynamic
Partial Order Reduction. IST Austria; 2016.
apa: Anonymous, 1, Anonymous, 2, Anonymous, 3, & Anonymous, 4. (2016). Data-centric
dynamic partial order reduction. IST Austria.
chicago: Anonymous, 1, 2 Anonymous, 3 Anonymous, and 4 Anonymous. Data-Centric
Dynamic Partial Order Reduction. IST Austria, 2016.
ieee: 1 Anonymous, 2 Anonymous, 3 Anonymous, and 4 Anonymous, Data-centric dynamic
partial order reduction. IST Austria, 2016.
ista: Anonymous 1, Anonymous 2, Anonymous 3, Anonymous 4. 2016. Data-centric dynamic
partial order reduction, IST Austria, 20p.
mla: Anonymous, 1, et al. Data-Centric Dynamic Partial Order Reduction. IST
Austria, 2016.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, 4 Anonymous, Data-Centric Dynamic
Partial Order Reduction, IST Austria, 2016.
date_created: 2018-12-12T11:39:23Z
date_published: 2016-07-15T00:00:00Z
date_updated: 2025-05-20T09:45:08Z
day: '15'
ddc:
- '000'
external_id:
arxiv:
- '1610.01188'
file:
- access_level: open_access
checksum: 1d69252d66bcdf782615ddfb911d2957
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:45Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5506'
file_name: IST-2016-620-v1+1_main.pdf
file_size: 538881
relation: main_file
- access_level: closed
checksum: deabb0eb8f237cae4f9542b28b0b6eb2
content_type: text/plain
creator: dernst
date_created: 2019-05-10T13:30:40Z
date_updated: 2020-07-14T12:46:58Z
file_id: '6405'
file_name: authornames.txt
file_size: 121
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '20'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '620'
related_material:
record:
- id: '5456'
relation: later_version
status: public
- id: '10417'
relation: later_version
status: public
status: public
title: Data-centric dynamic partial order reduction
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5449'
abstract:
- lang: eng
text: "The fixation probability is the probability that a new mutant introduced
in a homogeneous population eventually takes over the entire population.\r\nThe
fixation probability is a fundamental quantity of natural selection, and known
to depend on the population structure.\r\nAmplifiers of natural selection are
population structures which increase the fixation probability of advantageous
mutants, as compared to the baseline case of well-mixed populations. In this work
we focus on symmetric population structures represented as undirected graphs.
In the regime of undirected graphs, the strongest amplifier known has been the
Star graph, and the existence of undirected graphs with stronger amplification
properties has remained open for over a decade.\r\nIn this work we present the
Comet and Comet-swarm families of undirected graphs. We show that for a range
of fitness values of the mutants, the Comet and Comet-swarm graphs have fixation
probability strictly larger than the fixation probability of the Star graph, for
fixed population size and at the limit of large populations, respectively."
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- 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: Nowak, Martin
last_name: Nowak
citation:
ama: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Amplification on Undirected
Population Structures: Comets Beat Stars. IST Austria; 2016. doi:10.15479/AT:IST-2016-648-v1-1'
apa: 'Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Amplification
on undirected population structures: Comets beat stars. IST Austria. https://doi.org/10.15479/AT:IST-2016-648-v1-1'
chicago: 'Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Amplification on Undirected Population Structures: Comets Beat Stars.
IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-648-v1-1.'
ieee: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Amplification
on undirected population structures: Comets beat stars. IST Austria, 2016.'
ista: 'Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Amplification on
undirected population structures: Comets beat stars, IST Austria, 22p.'
mla: 'Pavlogiannis, Andreas, et al. Amplification on Undirected Population Structures:
Comets Beat Stars. IST Austria, 2016, doi:10.15479/AT:IST-2016-648-v1-1.'
short: 'A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Amplification on Undirected
Population Structures: Comets Beat Stars, IST Austria, 2016.'
date_created: 2018-12-12T11:39:24Z
date_published: 2016-11-09T00:00:00Z
date_updated: 2025-09-18T09:50:09Z
day: '09'
ddc:
- '519'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-648-v1-1
file:
- access_level: open_access
checksum: 8345a8c1e7d7f0cd92516d182b7fc59e
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:54:07Z
date_updated: 2020-07-14T12:46:58Z
file_id: '5529'
file_name: IST-2016-648-v1+1_tr.pdf
file_size: 1264221
relation: main_file
file_date_updated: 2020-07-14T12:46:58Z
fulldoi: https://doi.org/10.15479/AT:IST-2016-648-v1-1
has_accepted_license: '1'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Updated Version
page: '22'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '648'
related_material:
record:
- id: '512'
relation: later_version
status: public
status: public
title: 'Amplification on undirected population structures: Comets beat stars'
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5451'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- 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: Nowak, Martin
last_name: Nowak
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Strong Amplifiers of Natural
Selection. IST Austria; 2016. doi:10.15479/AT:IST-2016-728-v1-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Strong
amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2016-728-v1-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Strong Amplifiers of Natural Selection. IST Austria, 2016. https://doi.org/10.15479/AT:IST-2016-728-v1-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Strong amplifiers
of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Strong amplifiers
of natural selection, IST Austria, 34p.
mla: Pavlogiannis, Andreas, et al. Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2016-728-v1-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Strong Amplifiers of
Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:24Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2023-02-23T12:27:05Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2016-728-v1-1
file:
- access_level: open_access
checksum: 7b8bb17c322c0556acba6ac169fa71c1
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:04Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5465'
file_name: IST-2016-728-v1+1_main.pdf
file_size: 1014732
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
fulldoi: https://doi.org/10.15479/AT:IST-2016-728-v1-1
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '728'
status: public
title: Strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5452'
alternative_title:
- IST Austria Technical Report
article_processing_charge: No
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- 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: Nowak, Martin
last_name: Nowak
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers
of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-728-v2-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily
strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-728-v2-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria,
2016. https://doi.org/10.15479/AT:IST-2017-728-v2-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong
amplifiers of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong
amplifiers of natural selection, IST Austria, 32p.
mla: Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2017-728-v2-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong
Amplifiers of Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:25Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2025-04-15T07:55:39Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-728-v2-1
ec_funded: 1
file:
- access_level: open_access
checksum: 58e895f26c82f560c0f0989bf8b08599
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:52:59Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5460'
file_name: IST-2017-728-v2+1_main.pdf
file_size: 811558
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
fulldoi: https://doi.org/10.15479/AT:IST-2017-728-v2-1
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '32'
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '750'
related_material:
record:
- id: '5453'
relation: later_version
status: public
- id: '5559'
relation: popular_science
status: public
status: public
title: Arbitrarily strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5453'
alternative_title:
- IST Austria Technical Report
author:
- first_name: Andreas
full_name: Pavlogiannis, Andreas
id: 49704004-F248-11E8-B48F-1D18A9856A87
last_name: Pavlogiannis
orcid: 0000-0002-8943-0722
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- 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: Nowak, Martin
last_name: Nowak
citation:
ama: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. Arbitrarily Strong Amplifiers
of Natural Selection. IST Austria; 2016. doi:10.15479/AT:IST-2017-749-v3-1
apa: Pavlogiannis, A., Tkadlec, J., Chatterjee, K., & Nowak, M. (2016). Arbitrarily
strong amplifiers of natural selection. IST Austria. https://doi.org/10.15479/AT:IST-2017-749-v3-1
chicago: Pavlogiannis, Andreas, Josef Tkadlec, Krishnendu Chatterjee, and Martin
Nowak. Arbitrarily Strong Amplifiers of Natural Selection. IST Austria,
2016. https://doi.org/10.15479/AT:IST-2017-749-v3-1.
ieee: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, and M. Nowak, Arbitrarily strong
amplifiers of natural selection. IST Austria, 2016.
ista: Pavlogiannis A, Tkadlec J, Chatterjee K, Nowak M. 2016. Arbitrarily strong
amplifiers of natural selection, IST Austria, 34p.
mla: Pavlogiannis, Andreas, et al. Arbitrarily Strong Amplifiers of Natural Selection.
IST Austria, 2016, doi:10.15479/AT:IST-2017-749-v3-1.
short: A. Pavlogiannis, J. Tkadlec, K. Chatterjee, M. Nowak, Arbitrarily Strong
Amplifiers of Natural Selection, IST Austria, 2016.
date_created: 2018-12-12T11:39:25Z
date_published: 2016-12-30T00:00:00Z
date_updated: 2025-04-15T07:55:37Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.15479/AT:IST-2017-749-v3-1
file:
- access_level: open_access
checksum: 83b0313dab3bff4bdb6ac38695026fda
content_type: application/pdf
creator: system
date_created: 2018-12-12T11:53:13Z
date_updated: 2020-07-14T12:46:59Z
file_id: '5474'
file_name: IST-2017-749-v3+1_main.pdf
file_size: 1015647
relation: main_file
file_date_updated: 2020-07-14T12:46:59Z
fulldoi: https://doi.org/10.15479/AT:IST-2017-749-v3-1
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: '34'
publication_identifier:
issn:
- 2664-1690
publication_status: published
publisher: IST Austria
pubrep_id: '755'
related_material:
record:
- id: '5452'
relation: earlier_version
status: public
status: public
title: Arbitrarily strong amplifiers of natural selection
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5550'
abstract:
- lang: eng
text: "We collected flower colour information on species in the tribe Antirrhineae
from taxonomic literature. We also retreived molecular data from GenBank for as
many of these species as possible to estimate phylogenetic relationships among
these taxa. We then used the R package 'diversitree' to examine patterns of evolutionary
transitions between anthocyanin and yellow pigmentation across the phylogeny.\r\n\r\nFor
full details of the methods see:\r\nEllis TJ and Field DL \"Repeated gains in
yellow and anthocyanin pigmentation in flower colour transitions in the Antirrhineae”,
Annals of Botany (in press)"
article_processing_charge: No
author:
- first_name: Thomas
full_name: Ellis, Thomas
id: 3153D6D4-F248-11E8-B48F-1D18A9856A87
last_name: Ellis
orcid: 0000-0002-8511-0254
- first_name: David
full_name: Field, David
id: 419049E2-F248-11E8-B48F-1D18A9856A87
last_name: Field
orcid: 0000-0002-4014-8478
citation:
ama: Ellis T, Field D. Flower colour data and phylogeny (NEXUS) files. 2016. doi:10.15479/AT:ISTA:34
apa: Ellis, T., & Field, D. (2016). Flower colour data and phylogeny (NEXUS)
files. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:34
chicago: Ellis, Thomas, and David Field. “Flower Colour Data and Phylogeny (NEXUS)
Files.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:34.
ieee: T. Ellis and D. Field, “Flower colour data and phylogeny (NEXUS) files.” Institute
of Science and Technology Austria, 2016.
ista: Ellis T, Field D. 2016. Flower colour data and phylogeny (NEXUS) files, Institute
of Science and Technology Austria, 10.15479/AT:ISTA:34.
mla: Ellis, Thomas, and David Field. Flower Colour Data and Phylogeny (NEXUS)
Files. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:34.
short: T. Ellis, D. Field, (2016).
datarep_id: '34'
date_created: 2018-12-12T12:31:29Z
date_published: 2016-02-19T00:00:00Z
date_updated: 2025-09-22T07:32:43Z
day: '19'
ddc:
- '576'
department:
- _id: NiBa
doi: 10.15479/AT:ISTA:34
file:
- access_level: open_access
checksum: 950f85b80427d357bfeff09608ba02e9
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:27Z
date_updated: 2020-07-14T12:47:00Z
file_id: '5594'
file_name: IST-2016-34-v1+1_tellis_flower_colour_data.zip
file_size: 4468543
relation: main_file
file_date_updated: 2020-07-14T12:47:00Z
fulldoi: https://doi.org/10.15479/AT:ISTA:34
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '02'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
publist_id: '5828'
related_material:
record:
- id: '1382'
relation: research_paper
status: public
status: public
title: Flower colour data and phylogeny (NEXUS) files
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: '2016'
...
---
_id: '5555'
abstract:
- lang: eng
text: This FIJI script calculates the population average of the migration speed
as a function of time of all cells from wide field microscopy movies.
article_processing_charge: No
author:
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
citation:
ama: Hauschild R. Fiji script to determine average speed and direction of migration
of cells. 2016. doi:10.15479/AT:ISTA:44
apa: Hauschild, R. (2016). Fiji script to determine average speed and direction
of migration of cells. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:44
chicago: Hauschild, Robert. “Fiji Script to Determine Average Speed and Direction
of Migration of Cells.” Institute of Science and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:44.
ieee: R. Hauschild, “Fiji script to determine average speed and direction of migration
of cells.” Institute of Science and Technology Austria, 2016.
ista: Hauschild R. 2016. Fiji script to determine average speed and direction of
migration of cells, Institute of Science and Technology Austria, 10.15479/AT:ISTA:44.
mla: Hauschild, Robert. Fiji Script to Determine Average Speed and Direction
of Migration of Cells. Institute of Science and Technology Austria, 2016,
doi:10.15479/AT:ISTA:44.
short: R. Hauschild, (2016).
datarep_id: '44'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-07-08T00:00:00Z
date_updated: 2024-02-21T13:50:06Z
day: '08'
ddc:
- '570'
department:
- _id: Bio
doi: 10.15479/AT:ISTA:44
file:
- access_level: open_access
checksum: 9f96cddbcd4ed689f48712ffe234d5e5
content_type: application/zip
creator: system
date_created: 2018-12-12T13:03:03Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5621'
file_name: IST-2016-44-v1+1_migrationAnalyzer.zip
file_size: 20692
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
fulldoi: https://doi.org/10.15479/AT:ISTA:44
has_accepted_license: '1'
keyword:
- cell migration
- wide field microscopy
- FIJI
month: '07'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Fiji script to determine average speed and direction of migration of cells
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: '2016'
...
---
_id: '5556'
abstract:
- lang: eng
text: "MATLAB code and processed datasets available for reproducing the results
in: \r\nLukačišin, M.*, Landon, M.*, Jajoo, R*. (2016) Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast.\r\n*equal contributions"
article_processing_charge: No
author:
- first_name: Martin
full_name: Lukacisin, Martin
id: 298FFE8C-F248-11E8-B48F-1D18A9856A87
last_name: Lukacisin
orcid: 0000-0001-6549-4177
- first_name: Matthieu
full_name: Landon, Matthieu
last_name: Landon
- first_name: Rishi
full_name: Jajoo, Rishi
last_name: Jajoo
citation:
ama: Lukacisin M, Landon M, Jajoo R. MATLAB analysis code for “Sequence-Specific
Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing
and Backtracking in Yeast.” 2016. doi:10.15479/AT:ISTA:45
apa: Lukacisin, M., Landon, M., & Jajoo, R. (2016). MATLAB analysis code for
“Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional
Pausing and Backtracking in Yeast.” Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:45
chicago: Lukacisin, Martin, Matthieu Landon, and Rishi Jajoo. “MATLAB Analysis Code
for ‘Sequence-Specific Thermodynamic Properties of Nucleic Acids Influence Both
Transcriptional Pausing and Backtracking in Yeast.’” Institute of Science and
Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:45.
ieee: M. Lukacisin, M. Landon, and R. Jajoo, “MATLAB analysis code for ‘Sequence-Specific
Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing
and Backtracking in Yeast.’” Institute of Science and Technology Austria, 2016.
ista: Lukacisin M, Landon M, Jajoo R. 2016. MATLAB analysis code for ‘Sequence-Specific
Thermodynamic Properties of Nucleic Acids Influence Both Transcriptional Pausing
and Backtracking in Yeast’, Institute of Science and Technology Austria, 10.15479/AT:ISTA:45.
mla: Lukacisin, Martin, et al. MATLAB Analysis Code for “Sequence-Specific Thermodynamic
Properties of Nucleic Acids Influence Both Transcriptional Pausing and Backtracking
in Yeast.” Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:45.
short: M. Lukacisin, M. Landon, R. Jajoo, (2016).
datarep_id: '45'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-08-25T00:00:00Z
date_updated: 2025-07-10T11:49:51Z
day: '25'
ddc:
- '571'
department:
- _id: ToBo
doi: 10.15479/AT:ISTA:45
file:
- access_level: open_access
checksum: ee697f2b1ade4dc14d6ac0334dd832ab
content_type: application/zip
creator: system
date_created: 2018-12-12T13:02:58Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5616'
file_name: IST-2016-45-v1+1_PaperCode.zip
file_size: 296722548
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
fulldoi: https://doi.org/10.15479/AT:ISTA:45
has_accepted_license: '1'
keyword:
- transcription
- pausing
- backtracking
- polymerase
- RNA
- NET-seq
- nucleosome
- basepairing
license: https://creativecommons.org/licenses/by-sa/4.0/
month: '08'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '8431'
relation: used_in_publication
status: deleted
- id: '1029'
relation: research_paper
status: public
status: public
title: MATLAB analysis code for 'Sequence-Specific Thermodynamic Properties of Nucleic
Acids Influence Both Transcriptional Pausing and Backtracking in Yeast'
tmp:
image: /images/cc_by_sa.png
legal_code_url: https://creativecommons.org/licenses/by-sa/4.0/legalcode
name: Creative Commons Attribution-ShareAlike 4.0 International Public License (CC
BY-SA 4.0)
short: CC BY-SA (4.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2016'
...
---
_id: '5557'
abstract:
- lang: eng
text: "Small synthetic discrete tomography problems.\r\nSizes are 32x32, 64z64 and
256x256.\r\nProjection angles are 2, 4, and 6.\r\nNumber of labels are 3 and 5."
article_processing_charge: No
author:
- first_name: Paul
full_name: Swoboda, Paul
id: 446560C6-F248-11E8-B48F-1D18A9856A87
last_name: Swoboda
citation:
ama: Swoboda P. Synthetic discrete tomography problems. 2016. doi:10.15479/AT:ISTA:46
apa: Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT:ISTA:46
chicago: Swoboda, Paul. “Synthetic Discrete Tomography Problems.” Institute of Science
and Technology Austria, 2016. https://doi.org/10.15479/AT:ISTA:46.
ieee: P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science
and Technology Austria, 2016.
ista: Swoboda P. 2016. Synthetic discrete tomography problems, Institute of Science
and Technology Austria, 10.15479/AT:ISTA:46.
mla: Swoboda, Paul. Synthetic Discrete Tomography Problems. Institute of
Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:46.
short: P. Swoboda, (2016).
contributor:
- contributor_type: data_collector
first_name: Jan
last_name: Kuske
datarep_id: '46'
date_created: 2018-12-12T12:31:31Z
date_published: 2016-09-20T00:00:00Z
date_updated: 2024-02-21T13:50:21Z
day: '20'
ddc:
- '006'
department:
- _id: VlKo
doi: 10.15479/AT:ISTA:46
file:
- access_level: open_access
checksum: aa5a16a0dc888da7186fb8fc45e88439
content_type: application/zip
creator: system
date_created: 2018-12-12T13:05:19Z
date_updated: 2020-07-14T12:47:02Z
file_id: '5645'
file_name: IST-2016-46-v1+1_discrete_tomography_synthetic.zip
file_size: 36058401
relation: main_file
file_date_updated: 2020-07-14T12:47:02Z
fulldoi: https://doi.org/10.15479/AT:ISTA:46
has_accepted_license: '1'
keyword:
- discrete tomography
month: '09'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
status: public
title: Synthetic discrete tomography problems
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: '2016'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '5749'
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.
acknowledgement: The authors thank three anonymous reviewers and the editor for helpful
comments on the manuscript, as well as Dominique Schneider for feedback on an earlier
draft, Jenna Gallie for lytic λ and Julien Capelle for T5 and T6. This work was
supported by the Swiss National Science Foundation (PZ00P3_148255 to A.H.) and an
EU Marie Curie PEOPLE Postdoctoral Fellowship for Career Development (FP7-PEOPLE-2012-IEF-331824
to S.W.).
article_processing_charge: No
article_type: original
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. Adaptation to parasites
and costs of parasite resistance in mutator and nonmutator bacteria. Molecular
Biology and Evolution. 2016;33(3):770-782. doi:10.1093/molbev/msv270
apa: Wielgoss, S., Bergmiller, T., Bischofberger, A. M., & Hall, A. R. (2016).
Adaptation to parasites and costs of parasite resistance in mutator and nonmutator
bacteria. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msv270
chicago: Wielgoss, Sébastien, Tobias Bergmiller, Anna M. Bischofberger, and Alex
R. Hall. “Adaptation to Parasites and Costs of Parasite Resistance in Mutator
and Nonmutator Bacteria.” Molecular Biology and Evolution. Oxford University
Press, 2016. https://doi.org/10.1093/molbev/msv270.
ieee: S. Wielgoss, T. Bergmiller, A. M. Bischofberger, and A. R. Hall, “Adaptation
to parasites and costs of parasite resistance in mutator and nonmutator bacteria,”
Molecular Biology and Evolution, vol. 33, no. 3. Oxford University Press,
pp. 770–782, 2016.
ista: Wielgoss S, Bergmiller T, Bischofberger AM, Hall AR. 2016. Adaptation to parasites
and costs of parasite resistance in mutator and nonmutator bacteria. Molecular
Biology and Evolution. 33(3), 770–782.
mla: Wielgoss, Sébastien, et al. “Adaptation to Parasites and Costs of Parasite
Resistance in Mutator and Nonmutator Bacteria.” Molecular Biology and Evolution,
vol. 33, no. 3, Oxford University Press, 2016, pp. 770–82, doi:10.1093/molbev/msv270.
short: S. Wielgoss, T. Bergmiller, A.M. Bischofberger, A.R. Hall, Molecular Biology
and Evolution 33 (2016) 770–782.
date_created: 2018-12-18T13:18:10Z
date_published: 2016-03-01T00:00:00Z
date_updated: 2026-04-29T05:57:02Z
day: '01'
ddc:
- '576'
department:
- _id: CaGu
doi: 10.1093/molbev/msv270
external_id:
isi:
- '000371219500015'
pmid:
- '26609077'
file:
- access_level: open_access
checksum: 47d9010690b6c5c17f2ac830cc63ac5c
content_type: application/pdf
creator: dernst
date_created: 2018-12-18T13:21:45Z
date_updated: 2020-07-14T12:47:10Z
file_id: '5750'
file_name: 2016_MolBiolEvol_Wielgoss.pdf
file_size: 634037
relation: main_file
file_date_updated: 2020-07-14T12:47:10Z
fulldoi: https://doi.org/10.1093/molbev/msv270
has_accepted_license: '1'
intvolume: ' 33'
isi: 1
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 770-782
pmid: 1
publication: Molecular Biology and Evolution
publication_identifier:
eissn:
- 1537-1719
issn:
- 0737-4038
publication_status: published
publisher: Oxford University Press
pubrep_id: '587'
quality_controlled: '1'
related_material:
record:
- id: '9719'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Adaptation to parasites and costs of parasite resistance in mutator and nonmutator
bacteria
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 33
year: '2016'
...
---
_id: '5771'
abstract:
- lang: eng
text: Retroviruses such as HIV-1 assemble and bud from infected cells in an immature,
non-infectious form. Subsequently, a series of proteolytic cleavages catalysed
by the viral protease leads to a spectacular structural rearrangement of the viral
particle into a mature form that is competent to fuse with and infect a new cell.
Maturation involves changes in the structures of protein domains, in the interactions
between protein domains, and in the architecture of the viral components that
are assembled by the proteins. Tight control of proteolytic cleavages at different
sites is required for successful maturation, and the process is a major target
of antiretroviral drugs. Here we will describe what is known about the structures
of immature and mature retrovirus particles, and about the maturation process
by which one transitions into the other. Despite a wealth of available data, fundamental
questions about retroviral maturation remain unanswered.
author:
- first_name: Simone
full_name: Mattei, Simone
last_name: Mattei
- first_name: Florian
full_name: Schur, Florian
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: John AG
full_name: Briggs, John AG
last_name: Briggs
citation:
ama: Mattei S, Schur FK, Briggs JA. Retrovirus maturation—an extraordinary structural
transformation. Current Opinion in Virology. 2016;18(6):27-35. doi:10.1016/j.coviro.2016.02.008
apa: Mattei, S., Schur, F. K., & Briggs, J. A. (2016). Retrovirus maturation—an
extraordinary structural transformation. Current Opinion in Virology. Elsevier.
https://doi.org/10.1016/j.coviro.2016.02.008
chicago: Mattei, Simone, Florian KM Schur, and John AG Briggs. “Retrovirus Maturation—an
Extraordinary Structural Transformation.” Current Opinion in Virology.
Elsevier, 2016. https://doi.org/10.1016/j.coviro.2016.02.008.
ieee: S. Mattei, F. K. Schur, and J. A. Briggs, “Retrovirus maturation—an extraordinary
structural transformation,” Current Opinion in Virology, vol. 18, no. 6.
Elsevier, pp. 27–35, 2016.
ista: Mattei S, Schur FK, Briggs JA. 2016. Retrovirus maturation—an extraordinary
structural transformation. Current Opinion in Virology. 18(6), 27–35.
mla: Mattei, Simone, et al. “Retrovirus Maturation—an Extraordinary Structural Transformation.”
Current Opinion in Virology, vol. 18, no. 6, Elsevier, 2016, pp. 27–35,
doi:10.1016/j.coviro.2016.02.008.
short: S. Mattei, F.K. Schur, J.A. Briggs, Current Opinion in Virology 18 (2016)
27–35.
date_created: 2018-12-20T21:13:59Z
date_published: 2016-03-22T00:00:00Z
date_updated: 2021-01-12T08:03:22Z
day: '22'
ddc:
- '570'
doi: 10.1016/j.coviro.2016.02.008
extern: '1'
file:
- access_level: open_access
checksum: 320939d28ebd1adfb122338019892508
content_type: application/pdf
creator: dernst
date_created: 2019-01-09T13:05:44Z
date_updated: 2020-07-14T12:47:11Z
file_id: '5812'
file_name: 2016_CurrentOpinion_Mattei.pdf
file_size: 1773842
relation: main_file
file_date_updated: 2020-07-14T12:47:11Z
fulldoi: https://doi.org/10.1016/j.coviro.2016.02.008
has_accepted_license: '1'
intvolume: ' 18'
issue: '6'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '03'
oa: 1
oa_version: Published Version
page: 27-35
publication: Current Opinion in Virology
publication_identifier:
issn:
- 1879-6257
publication_status: published
publisher: Elsevier
quality_controlled: '1'
status: public
title: Retrovirus maturation—an extraordinary structural transformation
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: 18
year: '2016'
...
---
_id: '5805'
abstract:
- lang: eng
text: Discretization of sphere in the integer space follows a particular discretization
scheme, which, in principle, conforms to some topological model. This eventually
gives rise to interesting topological properties of a discrete spherical surface,
which need to be investigated for its analytical characterization. This paper
presents some novel results on the local topological properties of the naive model
of discrete sphere. They follow from the bijection of each quadraginta octant
of naive sphere with its projection map called f -map on the corresponding functional
plane and from the characterization of certain jumps in the f-map. As an application,
we have shown how these properties can be used in designing an efficient reconstruction
algorithm for a naive spherical surface from an input voxel set when it is sparse
or noisy.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nabhasmita
full_name: Sen, Nabhasmita
last_name: Sen
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Sen N, Biswas R, Bhowmick P. On some local topological properties of naive
discrete sphere. In: Computational Topology in Image Context. Vol 9667.
Cham: Springer Nature; 2016:253-264. doi:10.1007/978-3-319-39441-1_23'
apa: 'Sen, N., Biswas, R., & Bhowmick, P. (2016). On some local topological
properties of naive discrete sphere. In Computational Topology in Image Context
(Vol. 9667, pp. 253–264). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-39441-1_23'
chicago: 'Sen, Nabhasmita, Ranita Biswas, and Partha Bhowmick. “On Some Local Topological
Properties of Naive Discrete Sphere.” In Computational Topology in Image Context,
9667:253–64. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-39441-1_23.'
ieee: 'N. Sen, R. Biswas, and P. Bhowmick, “On some local topological properties
of naive discrete sphere,” in Computational Topology in Image Context,
vol. 9667, Cham: Springer Nature, 2016, pp. 253–264.'
ista: 'Sen N, Biswas R, Bhowmick P. 2016.On some local topological properties of
naive discrete sphere. In: Computational Topology in Image Context. LNCS, vol.
9667, 253–264.'
mla: Sen, Nabhasmita, et al. “On Some Local Topological Properties of Naive Discrete
Sphere.” Computational Topology in Image Context, vol. 9667, Springer Nature,
2016, pp. 253–64, doi:10.1007/978-3-319-39441-1_23.
short: N. Sen, R. Biswas, P. Bhowmick, in:, Computational Topology in Image Context,
Springer Nature, Cham, 2016, pp. 253–264.
conference:
end_date: 2016-06-17
location: Marseille, France
name: 'CTIC: Computational Topology in Image Context'
start_date: 2016-06-15
date_created: 2019-01-08T20:44:24Z
date_published: 2016-06-02T00:00:00Z
date_updated: 2022-01-28T08:01:22Z
day: '02'
department:
- _id: HeEd
doi: 10.1007/978-3-319-39441-1_23
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-39441-1_23
intvolume: ' 9667'
language:
- iso: eng
month: '06'
oa_version: None
page: 253-264
place: Cham
publication: Computational Topology in Image Context
publication_identifier:
eisbn:
- 978-3-319-39441-1
eissn:
- 1611-3349
isbn:
- 978-3-319-39440-4
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On some local topological properties of naive discrete sphere
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9667
year: '2016'
...
---
_id: '5806'
abstract:
- lang: eng
text: Although the concept of functional plane for naive plane is studied and reported
in the literature in great detail, no similar study is yet found for naive sphere.
This article exposes the first study in this line, opening up further prospects
of analyzing the topological properties of sphere in the discrete space. We show
that each quadraginta octant Q of a naive sphere forms a bijection with its projected
pixel set on a unique coordinate plane, which thereby serves as the functional
plane of Q, and hence gives rise to merely mono-jumps during back projection.
The other two coordinate planes serve as para-functional and dia-functional planes
for Q, as the former is ‘mono-jumping’ but not bijective, whereas the latter holds
neither of the two. Owing to this, the quadraginta octants form symmetry groups
and subgroups with equivalent jump conditions. We also show a potential application
in generating a special class of discrete 3D circles based on back projection
and jump bridging by Steiner voxels. A circle in this class possesses 4-symmetry,
uniqueness, and bounded distance from the underlying real sphere and real plane.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
citation:
ama: 'Biswas R, Bhowmick P. On functionality of quadraginta octants of naive sphere
with application to circle drawing. In: Discrete Geometry for Computer Imagery.
Vol 9647. Cham: Springer Nature; 2016:256-267. doi:10.1007/978-3-319-32360-2_20'
apa: 'Biswas, R., & Bhowmick, P. (2016). On functionality of quadraginta octants
of naive sphere with application to circle drawing. In Discrete Geometry for
Computer Imagery (Vol. 9647, pp. 256–267). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-32360-2_20'
chicago: 'Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta
Octants of Naive Sphere with Application to Circle Drawing.” In Discrete Geometry
for Computer Imagery, 9647:256–67. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-32360-2_20.'
ieee: R. Biswas and P. Bhowmick, “On functionality of quadraginta octants of naive
sphere with application to circle drawing,” in Discrete Geometry for Computer
Imagery, Nantes, France, 2016, vol. 9647, pp. 256–267.
ista: 'Biswas R, Bhowmick P. 2016. On functionality of quadraginta octants of naive
sphere with application to circle drawing. Discrete Geometry for Computer Imagery.
DGCI: International Conference on Discrete Geometry for Computer Imagery, LNCS,
vol. 9647, 256–267.'
mla: Biswas, Ranita, and Partha Bhowmick. “On Functionality of Quadraginta Octants
of Naive Sphere with Application to Circle Drawing.” Discrete Geometry for
Computer Imagery, vol. 9647, Springer Nature, 2016, pp. 256–67, doi:10.1007/978-3-319-32360-2_20.
short: R. Biswas, P. Bhowmick, in:, Discrete Geometry for Computer Imagery, Springer
Nature, Cham, 2016, pp. 256–267.
conference:
end_date: 2016-04-20
location: Nantes, France
name: 'DGCI: International Conference on Discrete Geometry for Computer Imagery'
start_date: 2016-04-18
date_created: 2019-01-08T20:44:37Z
date_published: 2016-04-09T00:00:00Z
date_updated: 2022-01-28T08:10:11Z
day: '09'
department:
- _id: HeEd
doi: 10.1007/978-3-319-32360-2_20
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-32360-2_20
intvolume: ' 9647'
language:
- iso: eng
month: '04'
oa_version: None
page: 256-267
place: Cham
publication: Discrete Geometry for Computer Imagery
publication_identifier:
eisbn:
- 978-3-319-32360-2
isbn:
- 978-3-319-32359-6
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On functionality of quadraginta octants of naive sphere with application to
circle drawing
type: conference
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9647
year: '2016'
...
---
_id: '5809'
abstract:
- lang: eng
text: A discrete spherical circle is a topologically well-connected 3D circle in
the integer space, which belongs to a discrete sphere as well as a discrete plane.
It is one of the most important 3D geometric primitives, but has not possibly
yet been studied up to its merit. This paper is a maiden exposition of some of
its elementary properties, which indicates a sense of its profound theoretical
prospects in the framework of digital geometry. We have shown how different types
of discretization can lead to forbidden and admissible classes, when one attempts
to define the discretization of a spherical circle in terms of intersection between
a discrete sphere and a discrete plane. Several fundamental theoretical results
have been presented, the algorithm for construction of discrete spherical circles
has been discussed, and some test results have been furnished to demonstrate its
practicality and usefulness.
article_processing_charge: No
author:
- first_name: Ranita
full_name: Biswas, Ranita
id: 3C2B033E-F248-11E8-B48F-1D18A9856A87
last_name: Biswas
orcid: 0000-0002-5372-7890
- first_name: Partha
full_name: Bhowmick, Partha
last_name: Bhowmick
- first_name: Valentin E.
full_name: Brimkov, Valentin E.
last_name: Brimkov
citation:
ama: 'Biswas R, Bhowmick P, Brimkov VE. On the connectivity and smoothness of discrete
spherical circles. In: Combinatorial Image Analysis. Vol 9448. Cham: Springer
Nature; 2016:86-100. doi:10.1007/978-3-319-26145-4_7'
apa: 'Biswas, R., Bhowmick, P., & Brimkov, V. E. (2016). On the connectivity
and smoothness of discrete spherical circles. In Combinatorial image analysis
(Vol. 9448, pp. 86–100). Cham: Springer Nature. https://doi.org/10.1007/978-3-319-26145-4_7'
chicago: 'Biswas, Ranita, Partha Bhowmick, and Valentin E. Brimkov. “On the Connectivity
and Smoothness of Discrete Spherical Circles.” In Combinatorial Image Analysis,
9448:86–100. Cham: Springer Nature, 2016. https://doi.org/10.1007/978-3-319-26145-4_7.'
ieee: 'R. Biswas, P. Bhowmick, and V. E. Brimkov, “On the connectivity and smoothness
of discrete spherical circles,” in Combinatorial image analysis, vol. 9448,
Cham: Springer Nature, 2016, pp. 86–100.'
ista: 'Biswas R, Bhowmick P, Brimkov VE. 2016.On the connectivity and smoothness
of discrete spherical circles. In: Combinatorial image analysis. vol. 9448, 86–100.'
mla: Biswas, Ranita, et al. “On the Connectivity and Smoothness of Discrete Spherical
Circles.” Combinatorial Image Analysis, vol. 9448, Springer Nature, 2016,
pp. 86–100, doi:10.1007/978-3-319-26145-4_7.
short: R. Biswas, P. Bhowmick, V.E. Brimkov, in:, Combinatorial Image Analysis,
Springer Nature, Cham, 2016, pp. 86–100.
conference:
end_date: 2015-11-27
location: Kolkata, India
name: 'IWCIA: International Workshop on Combinatorial Image Analysis'
start_date: 2015-11-24
date_created: 2019-01-08T20:45:19Z
date_published: 2016-01-06T00:00:00Z
date_updated: 2022-01-28T08:13:03Z
day: '06'
department:
- _id: HeEd
doi: 10.1007/978-3-319-26145-4_7
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-319-26145-4_7
intvolume: ' 9448'
language:
- iso: eng
month: '01'
oa_version: None
page: 86-100
place: Cham
publication: Combinatorial image analysis
publication_identifier:
eisbn:
- 978-3-319-26145-4
eissn:
- 1611-3349
isbn:
- 978-3-319-26144-7
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: On the connectivity and smoothness of discrete spherical circles
type: book_chapter
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 9448
year: '2016'
...
---
OA_place: repository
OA_type: green
_id: '587'
abstract:
- lang: eng
text: Quantum metrology exploits entangled states of particles to improve sensing
precision beyond the limit achievable with uncorrelated particles. All previous
methods required detection noise levels below this standard quantum limit to realize
the benefits of the intrinsic sensitivity provided by these states.We experimentally
demonstrate a widely applicable method for entanglement-enhanced measurements
without low-noise detection. The method involves an intermediate quantum phase
magnification step that eases implementation complexity. We used it to perform
squeezed-state metrology 8 decibels below the standard quantum limit with a detection
system that has a noise floor 10 decibels above the standard quantum limit.
article_processing_charge: No
arxiv: 1
author:
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Rajiv
full_name: Krishnakumar, Rajiv
last_name: Krishnakumar
- first_name: Nils
full_name: Engelsen, Nils
last_name: Engelsen
- first_name: Mark
full_name: Kasevich, Mark
last_name: Kasevich
citation:
ama: Hosten O, Krishnakumar R, Engelsen N, Kasevich M. Quantum Phase Magnification.
Vol 352. American Association for the Advancement of Science; 2016:1552-1555.
doi:10.1126/science.aaf3397
apa: Hosten, O., Krishnakumar, R., Engelsen, N., & Kasevich, M. (2016). Quantum
phase magnification (Vol. 352, pp. 1552–1555). American Association for the
Advancement of Science. https://doi.org/10.1126/science.aaf3397
chicago: Hosten, Onur, Rajiv Krishnakumar, Nils Engelsen, and Mark Kasevich. Quantum
Phase Magnification. Vol. 352. American Association for the Advancement of
Science, 2016. https://doi.org/10.1126/science.aaf3397.
ieee: O. Hosten, R. Krishnakumar, N. Engelsen, and M. Kasevich, Quantum phase
magnification, vol. 352. American Association for the Advancement of Science,
2016, pp. 1552–1555.
ista: Hosten O, Krishnakumar R, Engelsen N, Kasevich M. 2016. Quantum phase magnification,
American Association for the Advancement of Science,p.
mla: Hosten, Onur, et al. Quantum Phase Magnification. Vol. 352, American
Association for the Advancement of Science, 2016, pp. 1552–55, doi:10.1126/science.aaf3397.
short: O. Hosten, R. Krishnakumar, N. Engelsen, M. Kasevich, Quantum Phase Magnification,
American Association for the Advancement of Science, 2016.
date_created: 2018-12-11T11:47:21Z
date_published: 2016-06-24T00:00:00Z
date_updated: 2026-05-20T07:21:32Z
day: '24'
doi: 10.1126/science.aaf3397
extern: '1'
external_id:
arxiv:
- '1601.07683'
pmid:
- '27339982'
fulldoi: https://doi.org/10.1126/science.aaf3397
intvolume: ' 352'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1601.07683'
month: '06'
oa: 1
oa_version: Preprint
page: 1552 - 1555
pmid: 1
publication_identifier:
eisbn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '7214'
status: public
title: Quantum phase magnification
type: report
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 352
year: '2016'
...
---
OA_type: closed access
_id: '588'
abstract:
- lang: eng
text: Quantum metrology uses quantum entanglement - correlations in the properties
of microscopic systems - to improve the statistical precision of physical measurements.
When measuring a signal, such as the phase shift of a light beam or an atomic
state, a prominent limitation to achievable precision arises from the noise associated
with the counting of uncorrelated probe particles. This noise, commonly referred
to as shot noise or projection noise, gives rise to the standard quantum limit
(SQL) to phase resolution. However, it can be mitigated down to the fundamental
Heisenberg limit by entangling the probe particles. Despite considerable experimental
progress in a variety of physical systems, a question that persists is whether
these methods can achieve performance levels that compare favourably with optimized
conventional (non-entangled) systems. Here we demonstrate an approach that achieves
unprecedented levels of metrological improvement using half a million 87Rb atoms
in their 'clock' states. The ensemble is 20.1 ± 0.3 decibels (100-fold) spin-squeezed
via an optical-cavity-based measurement. We directly resolve small microwave-induced
rotations 18.5 ± 0.3 decibels (70-fold) beyond the SQL. The single-shot phase
resolution of 147 microradians achieved by the apparatus is better than that achieved
by the best engineered cold atom sensors despite lower atom numbers. We infer
entanglement of more than 680 ± 35 particles in the atomic ensemble. Applications
include atomic clocks, inertial sensors, and fundamental physics experiments such
as tests of general relativity or searches for electron electric dipole moment.
To this end, we demonstrate an atomic clock measurement with a quantum enhancement
of 10.5 ± 0.3 decibels (11-fold), limited by the phase noise of our microwave
source.
article_processing_charge: No
article_type: original
author:
- first_name: Onur
full_name: Hosten, Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
- first_name: Nils
full_name: Engelsen, Nils
last_name: Engelsen
- first_name: Rajiv
full_name: Krishnakumar, Rajiv
last_name: Krishnakumar
- first_name: Mark
full_name: Kasevich, Mark
last_name: Kasevich
citation:
ama: Hosten O, Engelsen N, Krishnakumar R, Kasevich M. Measurement noise 100 times
lower than the quantum-projection limit using entangled atoms. Nature.
2016;529:505-508. doi:10.1038/nature16176
apa: Hosten, O., Engelsen, N., Krishnakumar, R., & Kasevich, M. (2016). Measurement
noise 100 times lower than the quantum-projection limit using entangled atoms.
Nature. Springer Nature. https://doi.org/10.1038/nature16176
chicago: Hosten, Onur, Nils Engelsen, Rajiv Krishnakumar, and Mark Kasevich. “Measurement
Noise 100 Times Lower than the Quantum-Projection Limit Using Entangled Atoms.”
Nature. Springer Nature, 2016. https://doi.org/10.1038/nature16176.
ieee: O. Hosten, N. Engelsen, R. Krishnakumar, and M. Kasevich, “Measurement noise
100 times lower than the quantum-projection limit using entangled atoms,” Nature,
vol. 529. Springer Nature, pp. 505–508, 2016.
ista: Hosten O, Engelsen N, Krishnakumar R, Kasevich M. 2016. Measurement noise
100 times lower than the quantum-projection limit using entangled atoms. Nature.
529, 505–508.
mla: Hosten, Onur, et al. “Measurement Noise 100 Times Lower than the Quantum-Projection
Limit Using Entangled Atoms.” Nature, vol. 529, Springer Nature, 2016,
pp. 505–08, doi:10.1038/nature16176.
short: O. Hosten, N. Engelsen, R. Krishnakumar, M. Kasevich, Nature 529 (2016) 505–508.
date_created: 2018-12-11T11:47:21Z
date_published: 2016-01-28T00:00:00Z
date_updated: 2026-05-20T07:16:23Z
day: '28'
doi: 10.1038/nature16176
extern: '1'
external_id:
pmid:
- ' 26751056'
fulldoi: https://doi.org/10.1038/nature16176
intvolume: ' 529'
language:
- iso: eng
month: '01'
oa_version: None
page: 505 - 508
pmid: 1
publication: Nature
publication_identifier:
eissn:
- ' 1476-4687'
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
publist_id: '7215'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Measurement noise 100 times lower than the quantum-projection limit using entangled
atoms
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 529
year: '2016'
...