---
_id: '12720'
abstract:
- lang: eng
text: Here we describe the in vivo DNA assembly approach, where molecular cloning
procedures are performed using an E. coli recA-independent recombination pathway,
which assembles linear fragments of DNA with short homologous termini. This pathway
is present in all standard laboratory E. coli strains and, by bypassing the need
for in vitro DNA assembly, allows simplified molecular cloning to be performed
without the plasmid instability issues associated with specialized recombination-cloning
bacterial strains. The methodology requires specific primer design and can perform
all standard plasmid modifications (insertions, deletions, mutagenesis, and sub-cloning)
in a rapid, simple, and cost-efficient manner, as it does not require commercial
kits or specialized bacterial strains. Additionally, this approach can be used
to perform complex procedures such as multiple modifications to a plasmid, as
up to 6 linear fragments can be assembled in vivo by this recombination pathway.
Procedures generally require less than 3 h, involving PCR amplification, DpnI
digestion of template DNA, and transformation, upon which circular plasmids are
assembled. In this chapter we describe the requirements, procedure, and potential
pitfalls when using this technique, as well as protocol variations to overcome
the most common issues.
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: Sandra
full_name: Arroyo-Urea, Sandra
last_name: Arroyo-Urea
- first_name: Jake
full_name: Watson, Jake
id: 63836096-4690-11EA-BD4E-32803DDC885E
last_name: Watson
orcid: 0000-0002-8698-3823
- first_name: Javier
full_name: García-Nafría, Javier
last_name: García-Nafría
citation:
ama: 'Arroyo-Urea S, Watson J, García-Nafría J. Molecular Cloning Using In Vivo
DNA Assembly. In: Scarlett G, ed. DNA Manipulation and Analysis. Vol 2633.
MIMB. New York, NY, United States: Springer Nature; 2023:33-44. doi:10.1007/978-1-0716-3004-4_3'
apa: 'Arroyo-Urea, S., Watson, J., & García-Nafría, J. (2023). Molecular Cloning
Using In Vivo DNA Assembly. In G. Scarlett (Ed.), DNA Manipulation and Analysis
(Vol. 2633, pp. 33–44). New York, NY, United States: Springer Nature. https://doi.org/10.1007/978-1-0716-3004-4_3'
chicago: 'Arroyo-Urea, Sandra, Jake Watson, and Javier García-Nafría. “Molecular
Cloning Using In Vivo DNA Assembly.” In DNA Manipulation and Analysis,
edited by Garry Scarlett, 2633:33–44. MIMB. New York, NY, United States: Springer
Nature, 2023. https://doi.org/10.1007/978-1-0716-3004-4_3.'
ieee: 'S. Arroyo-Urea, J. Watson, and J. García-Nafría, “Molecular Cloning Using
In Vivo DNA Assembly,” in DNA Manipulation and Analysis, vol. 2633, G.
Scarlett, Ed. New York, NY, United States: Springer Nature, 2023, pp. 33–44.'
ista: 'Arroyo-Urea S, Watson J, García-Nafría J. 2023.Molecular Cloning Using In
Vivo DNA Assembly. In: DNA Manipulation and Analysis. Methods in Molecular Biology,
vol. 2633, 33–44.'
mla: Arroyo-Urea, Sandra, et al. “Molecular Cloning Using In Vivo DNA Assembly.”
DNA Manipulation and Analysis, edited by Garry Scarlett, vol. 2633, Springer
Nature, 2023, pp. 33–44, doi:10.1007/978-1-0716-3004-4_3.
short: S. Arroyo-Urea, J. Watson, J. García-Nafría, in:, G. Scarlett (Ed.), DNA
Manipulation and Analysis, Springer Nature, New York, NY, United States, 2023,
pp. 33–44.
date_created: 2023-03-12T23:01:02Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-03-16T08:34:24Z
day: '01'
department:
- _id: PeJo
doi: 10.1007/978-1-0716-3004-4_3
editor:
- first_name: Garry
full_name: Scarlett, Garry
last_name: Scarlett
external_id:
pmid:
- '36853454'
intvolume: ' 2633'
language:
- iso: eng
month: '03'
oa_version: None
page: 33-44
place: New York, NY, United States
pmid: 1
publication: DNA Manipulation and Analysis
publication_identifier:
eisbn:
- 978-1-0716-3004-4
eissn:
- 1940-6029
isbn:
- 978-1-0716-3003-7
issn:
- 1064-3745
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: MIMB
status: public
title: Molecular Cloning Using In Vivo DNA Assembly
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2633
year: '2023'
...
---
_id: '12735'
abstract:
- lang: eng
text: "Asynchronous programming has gained significant popularity over the last
decade: support for this programming pattern is available in many popular languages
via libraries and native language implementations, typically in the form of coroutines
or the async/await construct. Instead of programming via shared memory, this concept
assumes implicit synchronization through message passing. The key data structure
enabling such communication is the rendezvous channel. Roughly, a rendezvous channel
is a blocking queue of size zero, so both send(e) and receive() operations wait
for each other, performing a rendezvous when they meet. To optimize the message
passing pattern, channels are usually equipped with a fixed-size buffer, so sends
do not suspend and put elements into the buffer until its capacity is exceeded.
This primitive is known as a buffered channel.\r\n\r\nThis paper presents a fast
and scalable algorithm for both rendezvous and buffered channels. Similarly to
modern queues, our solution is based on an infinite array with two positional
counters for send(e) and receive() operations, leveraging the unconditional Fetch-And-Add
instruction to update them. Yet, the algorithm requires non-trivial modifications
of this classic pattern, in order to support the full channel semantics, such
as buffering and cancellation of waiting requests. We compare the performance
of our solution to that of the Kotlin implementation, as well as against other
academic proposals, showing up to 9.8× speedup. To showcase its expressiveness
and performance, we also integrated the proposed algorithm into the standard Kotlin
Coroutines library, replacing the previous channel implementations."
article_processing_charge: No
author:
- first_name: Nikita
full_name: Koval, Nikita
id: 2F4DB10C-F248-11E8-B48F-1D18A9856A87
last_name: Koval
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Roman
full_name: Elizarov, Roman
last_name: Elizarov
citation:
ama: 'Koval N, Alistarh D-A, Elizarov R. Fast and scalable channels in Kotlin Coroutines.
In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming. Association for Computing Machinery; 2023:107-118. doi:10.1145/3572848.3577481'
apa: 'Koval, N., Alistarh, D.-A., & Elizarov, R. (2023). Fast and scalable channels
in Kotlin Coroutines. In Proceedings of the ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming (pp. 107–118). Montreal, QC, Canada:
Association for Computing Machinery. https://doi.org/10.1145/3572848.3577481'
chicago: Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Fast and Scalable
Channels in Kotlin Coroutines.” In Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming, 107–18. Association for
Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577481.
ieee: N. Koval, D.-A. Alistarh, and R. Elizarov, “Fast and scalable channels in
Kotlin Coroutines,” in Proceedings of the ACM SIGPLAN Symposium on Principles
and Practice of Parallel Programming, Montreal, QC, Canada, 2023, pp. 107–118.
ista: 'Koval N, Alistarh D-A, Elizarov R. 2023. Fast and scalable channels in Kotlin
Coroutines. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice
of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel
Programming, 107–118.'
mla: Koval, Nikita, et al. “Fast and Scalable Channels in Kotlin Coroutines.” Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
Association for Computing Machinery, 2023, pp. 107–18, doi:10.1145/3572848.3577481.
short: N. Koval, D.-A. Alistarh, R. Elizarov, in:, Proceedings of the ACM SIGPLAN
Symposium on Principles and Practice of Parallel Programming, Association for
Computing Machinery, 2023, pp. 107–118.
conference:
end_date: 2023-03-01
location: Montreal, QC, Canada
name: 'PPoPP: Sympopsium on Principles and Practice of Parallel Programming'
start_date: 2023-02-25
date_created: 2023-03-19T23:00:58Z
date_published: 2023-02-25T00:00:00Z
date_updated: 2023-03-20T07:29:28Z
day: '25'
department:
- _id: DaAl
doi: 10.1145/3572848.3577481
external_id:
arxiv:
- '2211.04986'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2211.04986
month: '02'
oa: 1
oa_version: Preprint
page: 107-118
publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming
publication_identifier:
isbn:
- '9798400700156'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fast and scalable channels in Kotlin Coroutines
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12736'
abstract:
- lang: eng
text: Although a wide variety of handcrafted concurrent data structures have been
proposed, there is considerable interest in universal approaches (Universal Constructions
or UCs) for building concurrent data structures. UCs (semi-)automatically convert
a sequential data structure into a concurrent one. The simplest approach uses
locks [3, 6] that protect a sequential data structure and allow only one process
to access it at a time. However, the resulting data structure is blocking. Most
work on UCs instead focuses on obtaining non-blocking progress guarantees such
as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have
appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware
UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et
al.
acknowledgement: 'This work was supported by: the Natural Sciences and Engineering
Research Council of Canada (NSERC) Discovery Program grant: RGPIN-2019-04227, and
the Canada Foundation for Innovation John R. Evans Leaders Fund (CFI-JELF) with
equal support from the Ontario Research Fund CFI Leaders Opportunity Fund: 38512.'
article_processing_charge: No
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- first_name: Trevor A
full_name: Brown, Trevor A
id: 3569F0A0-F248-11E8-B48F-1D18A9856A87
last_name: Brown
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Ilya
full_name: Kokorin, Ilya
last_name: Kokorin
citation:
ama: Aksenov V, Brown TA, Fedorov A, Kokorin I. Unexpected Scaling in Path Copying
Trees. Association for Computing Machinery; 2023:438-440. doi:10.1145/3572848.3577512
apa: 'Aksenov, V., Brown, T. A., Fedorov, A., & Kokorin, I. (2023). Unexpected
scaling in path copying trees. Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming (pp. 438–440). Montreal,
QB, Canada: Association for Computing Machinery. https://doi.org/10.1145/3572848.3577512'
chicago: Aksenov, Vitaly, Trevor A Brown, Alexander Fedorov, and Ilya Kokorin. Unexpected
Scaling in Path Copying Trees. Proceedings of the ACM SIGPLAN Symposium
on Principles and Practice of Parallel Programming. Association for Computing
Machinery, 2023. https://doi.org/10.1145/3572848.3577512.
ieee: V. Aksenov, T. A. Brown, A. Fedorov, and I. Kokorin, Unexpected scaling
in path copying trees. Association for Computing Machinery, 2023, pp. 438–440.
ista: Aksenov V, Brown TA, Fedorov A, Kokorin I. 2023. Unexpected scaling in path
copying trees, Association for Computing Machinery,p.
mla: Aksenov, Vitaly, et al. “Unexpected Scaling in Path Copying Trees.” Proceedings
of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming,
Association for Computing Machinery, 2023, pp. 438–40, doi:10.1145/3572848.3577512.
short: V. Aksenov, T.A. Brown, A. Fedorov, I. Kokorin, Unexpected Scaling in Path
Copying Trees, Association for Computing Machinery, 2023.
conference:
end_date: 2023-03-01
location: Montreal, QB, Canada
name: 'PPoPP: Sympopsium on Principles and Practice of Parallel Programming'
start_date: 2023-02-25
date_created: 2023-03-19T23:00:58Z
date_published: 2023-02-25T00:00:00Z
date_updated: 2023-03-20T07:57:27Z
day: '25'
department:
- _id: DaAl
- _id: GradSch
doi: 10.1145/3572848.3577512
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1145/3572848.3577512
month: '02'
oa: 1
oa_version: Published Version
page: 438-440
publication: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of
Parallel Programming
publication_identifier:
isbn:
- '9798400700156'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
status: public
title: Unexpected scaling in path copying trees
type: conference_poster
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '12760'
abstract:
- lang: eng
text: "Dynamic programming (DP) is one of the fundamental paradigms in algorithm
design. However,\r\nmany DP algorithms have to fill in large DP tables, represented
by two-dimensional arrays, which causes at least quadratic running times and space
usages. This has led to the development of improved algorithms for special cases
when the DPs satisfy additional properties like, e.g., the Monge property or total
monotonicity.\r\nIn this paper, we consider a new condition which assumes (among
some other technical assumptions) that the rows of the DP table are monotone.
Under this assumption, we introduce\r\na novel data structure for computing (1
+ ϵ)-approximate DP solutions in near-linear time and\r\nspace in the static setting,
and with polylogarithmic update times when the DP entries change\r\ndynamically.
To the best of our knowledge, our new condition is incomparable to previous conditions
and is the first which allows to derive dynamic algorithms based on existing DPs.
Instead of using two-dimensional arrays to store the DP tables, we store the rows
of the DP tables using monotone piecewise constant functions. This allows us to
store length-n DP table rows with entries in [0, W] using only polylog(n, W) bits,
and to perform operations, such as (min, +)-convolution or rounding, on these
functions in polylogarithmic time.\r\nWe further present several applications
of our data structure. For bicriteria versions of k-balanced graph partitioning
and simultaneous source location, we obtain the first dynamic algorithms with
subpolynomial update times, as well as the first static algorithms using only
near-linear time and space. Additionally, we obtain the currently fastest algorithm
for fully dynamic knapsack."
acknowledgement: "Monika Henzinger: This project has received funding from the European
Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic
Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project
“Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional
funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nStefan Neumann: This research
is supported by the the ERC Advanced Grant REBOUND (834862) and the EC H2020 RIA
project SoBigData++ (871042).\r\nStefan Schmid: Research supported by Austrian Science
Fund (FWF) project I 5025-N (DELTA), 2020-2024."
alternative_title:
- LIPIcs
article_number: '36'
article_processing_charge: No
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Stefan
full_name: Neumann, Stefan
last_name: Neumann
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Henzinger MH, Neumann S, Räcke H, Schmid S. Dynamic maintenance of monotone
dynamic programs and applications. In: 40th International Symposium on Theoretical
Aspects of Computer Science. Vol 254. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2023. doi:10.4230/LIPIcs.STACS.2023.36'
apa: 'Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2023). Dynamic
maintenance of monotone dynamic programs and applications. In 40th International
Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg,
Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2023.36'
chicago: Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Dynamic
Maintenance of Monotone Dynamic Programs and Applications.” In 40th International
Symposium on Theoretical Aspects of Computer Science, Vol. 254. Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.STACS.2023.36.
ieee: M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance
of monotone dynamic programs and applications,” in 40th International Symposium
on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.
ista: 'Henzinger MH, Neumann S, Räcke H, Schmid S. 2023. Dynamic maintenance of
monotone dynamic programs and applications. 40th International Symposium on Theoretical
Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer
Science, LIPIcs, vol. 254, 36.'
mla: Henzinger, Monika H., et al. “Dynamic Maintenance of Monotone Dynamic Programs
and Applications.” 40th International Symposium on Theoretical Aspects of Computer
Science, vol. 254, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023, doi:10.4230/LIPIcs.STACS.2023.36.
short: M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 40th International
Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2023.
conference:
end_date: 2023-03-09
location: Hamburg, Germany
name: 'STACS: Symposium on Theoretical Aspects of Computer Science'
start_date: 2023-03-07
date_created: 2023-03-26T22:01:07Z
date_published: 2023-03-01T00:00:00Z
date_updated: 2023-03-27T06:46:27Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.STACS.2023.36
external_id:
arxiv:
- '2301.01744'
file:
- access_level: open_access
checksum: 22141ab8bc55188e2dfff665e5daecbd
content_type: application/pdf
creator: dernst
date_created: 2023-03-27T06:37:22Z
date_updated: 2023-03-27T06:37:22Z
file_id: '12769'
file_name: 2023_LIPICS_HenzingerM.pdf
file_size: 872706
relation: main_file
success: 1
file_date_updated: 2023-03-27T06:37:22Z
has_accepted_license: '1'
intvolume: ' 254'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: 40th International Symposium on Theoretical Aspects of Computer Science
publication_identifier:
isbn:
- '9783959772662'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dynamic maintenance of monotone dynamic programs and applications
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: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 254
year: '2023'
...
---
_id: '12716'
abstract:
- lang: eng
text: "The process of detecting and evaluating sensory information to guide behaviour
is termed perceptual decision-making (PDM), and is critical for the ability of
an organism to interact with its external world. Individuals with autism, a neurodevelopmental
condition primarily characterised by social and communication difficulties, frequently
exhibit altered sensory processing and PDM difficulties are widely reported. Recent
technological advancements have pushed forward our understanding of the genetic
changes accompanying this condition, however our understanding of how these mutations
affect the function of specific neuronal circuits and bring about the corresponding
behavioural changes remains limited. Here, we use an innate PDM task, the looming
avoidance response (LAR) paradigm, to identify a convergent behavioural abnormality
across three molecularly distinct genetic mouse models of autism (Cul3, Setd5
and Ptchd1). Although mutant mice can rapidly detect threatening visual stimuli,
their responses are consistently delayed, requiring longer to initiate an appropriate
response than their wild-type siblings. Mutant animals show abnormal adaptation
in both their stimulus- evoked escape responses and exploratory dynamics following
repeated stimulus presentations. Similarly delayed behavioural responses are observed
in wild-type animals when faced with more ambiguous threats, suggesting the mutant
phenotype could arise from a dysfunction in the flexible control of this PDM process.\r\nOur
knowledge of the core neuronal circuitry mediating the LAR facilitated a detailed
dissection of the neuronal mechanisms underlying the behavioural impairment. In
vivo extracellular recording revealed that visual responses were unaffected within
a key brain region for the rapid processing of visual threats, the superior colliculus
(SC), indicating that the behavioural delay was unlikely to originate from sensory
impairments. Delayed behavioural responses were recapitulated in the Setd5 model
following optogenetic stimulation of the excitatory output neurons of the SC,
which are known to mediate escape initiation through the activation of cells in
the underlying dorsal periaqueductal grey (dPAG). In vitro patch-clamp recordings
of dPAG cells uncovered a stark hypoexcitability phenotype in two out of the three
genetic models investigated (Setd5 and Ptchd1), that in Setd5, is mediated by
the misregulation of voltage-gated potassium channels. Overall, our results show
that the ability to use visual information to drive efficient escape responses
is impaired in three diverse genetic mouse models of autism and that, in one of
the models studied, this behavioural delay likely originates from differences
in the intrinsic excitability of a key subcortical node, the dPAG. Furthermore,
this work showcases the use of an innate behavioural paradigm to mechanistically
dissect PDM processes in autism."
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: LifeSc
- _id: M-Shop
- _id: CampIT
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Laura
full_name: Burnett, Laura
id: 3B717F68-F248-11E8-B48F-1D18A9856A87
last_name: Burnett
orcid: 0000-0002-8937-410X
citation:
ama: Burnett L. To flee, or not to flee? Using innate defensive behaviours to investigate
rapid perceptual decision-making through subcortical circuits in mouse models
of autism. 2023. doi:10.15479/at:ista:12716
apa: Burnett, L. (2023). To flee, or not to flee? Using innate defensive behaviours
to investigate rapid perceptual decision-making through subcortical circuits in
mouse models of autism. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12716
chicago: Burnett, Laura. “To Flee, or Not to Flee? Using Innate Defensive Behaviours
to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in
Mouse Models of Autism.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12716.
ieee: L. Burnett, “To flee, or not to flee? Using innate defensive behaviours to
investigate rapid perceptual decision-making through subcortical circuits in mouse
models of autism,” Institute of Science and Technology Austria, 2023.
ista: Burnett L. 2023. To flee, or not to flee? Using innate defensive behaviours
to investigate rapid perceptual decision-making through subcortical circuits in
mouse models of autism. Institute of Science and Technology Austria.
mla: Burnett, Laura. To Flee, or Not to Flee? Using Innate Defensive Behaviours
to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in
Mouse Models of Autism. Institute of Science and Technology Austria, 2023,
doi:10.15479/at:ista:12716.
short: L. Burnett, To Flee, or Not to Flee? Using Innate Defensive Behaviours to
Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in Mouse
Models of Autism, Institute of Science and Technology Austria, 2023.
date_created: 2023-03-08T15:19:45Z
date_published: 2023-03-10T00:00:00Z
date_updated: 2023-04-05T10:59:04Z
day: '10'
ddc:
- '599'
- '573'
degree_awarded: PhD
department:
- _id: GradSch
- _id: MaJö
doi: 10.15479/at:ista:12716
ec_funded: 1
file:
- access_level: closed
checksum: 6c6d9cc2c4cdacb74e6b1047a34d7332
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: lburnett
date_created: 2023-03-08T15:08:46Z
date_updated: 2023-03-08T15:08:46Z
file_id: '12717'
file_name: Burnett_Thesis_2023.docx
file_size: 23029260
relation: source_file
- access_level: open_access
checksum: cebc77705288bf4382db9b3541483cd0
content_type: application/pdf
creator: lburnett
date_created: 2023-03-08T15:08:46Z
date_updated: 2023-03-08T15:08:46Z
file_id: '12718'
file_name: Burnett_Thesis_2023_pdfA.pdf
file_size: 11959869
relation: main_file
success: 1
file_date_updated: 2023-03-08T15:08:46Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: '178'
project:
- _id: 2634E9D2-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '756502'
name: Circuits of Visual Attention
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Maximilian A
full_name: Jösch, Maximilian A
id: 2BD278E6-F248-11E8-B48F-1D18A9856A87
last_name: Jösch
orcid: 0000-0002-3937-1330
title: To flee, or not to flee? Using innate defensive behaviours to investigate rapid
perceptual decision-making through subcortical circuits in mouse models of autism
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2023'
...