---
_id: '4561'
abstract:
- lang: eng
text: 'We present a formalism for specifying component interfaces that expose component
requirements on limited resources. The formalism permits an algorithmic check
if two or more components, when put together, exceed the available resources.
Moreover, the formalism can be used to compute the quantity of resources necessary
for satisfying the requirements of a collection of components. The formalism can
be instantiated in several ways. For example, several components may draw power
from the same source. Then, the formalism supports compatibility checks such as:
can two components, when put together, achieve their tasks without ever exceeding
the available amount of peak power? or, can they achieve their tasks by using
no more than the initially available amount of energy (i.e., power accumulated
over time)? The corresponding quantitative questions that our algorithms answer
are the following: what is the amount of peak power needed for two components
to be put together? what is the corresponding amount of initial energy? To solve
these questions, we model interfaces with resource requirements as games with
quantitative objectives. The games are played on state spaces where each state
is labeled by a number (representing, e.g., power consumption), and a play produces
an infinite path of labels. The objective may be, for example, to minimize the
largest label that occurs during a play. We illustrate our approach by modeling
compatibility questions for the components of robot control software, and of wireless
sensor networks.'
acknowledgement: This research was supported in part by the DARPA grant F33615-00-C-1693,
the MARCO grant 98-DT-660, the ONR grant N00014-02-1-0671, and the NSF grants CCR-0085949,
CCR-0132780, CCR-0234690, and CCR-9988172.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Arindam
full_name: Chakrabarti, Arindam
last_name: Chakrabarti
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Mariëlle
full_name: Stoelinga, Mariëlle
last_name: Stoelinga
citation:
ama: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. Resource interfaces.
In: Third International Conference on Embedded Software. Vol 2855. ACM;
2003:117-133. doi:10.1007/978-3-540-45212-6_9'
apa: 'Chakrabarti, A., De Alfaro, L., Henzinger, T. A., & Stoelinga, M. (2003).
Resource interfaces. In Third International Conference on Embedded Software
(Vol. 2855, pp. 117–133). Philadelphia, PA, USA: ACM. https://doi.org/10.1007/978-3-540-45212-6_9'
chicago: Chakrabarti, Arindam, Luca De Alfaro, Thomas A Henzinger, and Mariëlle
Stoelinga. “Resource Interfaces.” In Third International Conference on Embedded
Software, 2855:117–33. ACM, 2003. https://doi.org/10.1007/978-3-540-45212-6_9.
ieee: A. Chakrabarti, L. De Alfaro, T. A. Henzinger, and M. Stoelinga, “Resource
interfaces,” in Third International Conference on Embedded Software, Philadelphia,
PA, USA, 2003, vol. 2855, pp. 117–133.
ista: 'Chakrabarti A, De Alfaro L, Henzinger TA, Stoelinga M. 2003. Resource interfaces.
Third International Conference on Embedded Software. EMSOFT: Embedded Software
, LNCS, vol. 2855, 117–133.'
mla: Chakrabarti, Arindam, et al. “Resource Interfaces.” Third International
Conference on Embedded Software, vol. 2855, ACM, 2003, pp. 117–33, doi:10.1007/978-3-540-45212-6_9.
short: A. Chakrabarti, L. De Alfaro, T.A. Henzinger, M. Stoelinga, in:, Third International
Conference on Embedded Software, ACM, 2003, pp. 117–133.
conference:
end_date: 2003-10-15
location: Philadelphia, PA, USA
name: 'EMSOFT: Embedded Software '
start_date: 2003-10-13
date_created: 2018-12-11T12:09:29Z
date_published: 2003-09-29T00:00:00Z
date_updated: 2024-01-08T10:48:11Z
day: '29'
doi: 10.1007/978-3-540-45212-6_9
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-45212-6_9
intvolume: ' 2855'
language:
- iso: eng
month: '09'
oa_version: None
page: 117 - 133
publication: Third International Conference on Embedded Software
publication_identifier:
isbn:
- '9783540202233'
publication_status: published
publisher: ACM
publist_id: '148'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Resource interfaces
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2855
year: '2003'
...
---
_id: '4628'
abstract:
- lang: eng
text: 'Discounting the future means that the value, today, of a unit payoffis 1
if the payoffo ccurs today, a if it occurs tomorrow, a 2 if it occurs the day
after tomorrow, and so on, for some real-valued discount factor 0 < a <
1. Discounting (or inflation) is a key paradigm in economics and has been studied
in Markov decision processes as well as game theory. We submit that discounting
also has a natural place in systems engineering: for nonterminating systems, a
potential bug in the far-away future is less troubling than a potential bug today.
We therefore develop a systems theory with discounting. Our theory includes several
basic elements: discounted versions of system properties that correspond to the
ω-regular properties, fixpoint-based algorithms for checking discounted properties,
and a quantitative notion of bisimilarity for capturing the difference between
two states with respect to discounted properties. We present the theory in a general
form that applies to probabilistic systems as well as multicomponent systems (games),
but it readily specializes to classical transition systems. We show that discounting,
besides its natural practical appeal, has also several mathematical benefits.
First, the resulting theory is robust, in that small perturbations of a system
can cause only small changes in the properties of the system. Second, the theory
is computational, in that the values of discounted properties, as well as the
discounted bisimilarity distance between states, can be computed to any desired
degree of precision.'
acknowledgement: This research was supported in part by the NSF CAREER award CCR-0132780,
the DARPA grant F33615-C-98-3614, the NSF grants CCR-9988172, CCR-0234690 and CCR-0225610,
and the ONR grant N00014-02-1-0671.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
citation:
ama: 'De Alfaro L, Henzinger TA, Majumdar R. Discounting the future in systems theory.
In: Proceedings of the 30th International Colloquium on Automata, Languages
and Programming. Vol 2719. Springer; 2003:1022-1037. doi:10.1007/3-540-45061-0_79'
apa: 'De Alfaro, L., Henzinger, T. A., & Majumdar, R. (2003). Discounting the
future in systems theory. In Proceedings of the 30th International Colloquium
on Automata, Languages and Programming (Vol. 2719, pp. 1022–1037). Eindhoven,
The Netherlands: Springer. https://doi.org/10.1007/3-540-45061-0_79'
chicago: De Alfaro, Luca, Thomas A Henzinger, and Ritankar Majumdar. “Discounting
the Future in Systems Theory.” In Proceedings of the 30th International Colloquium
on Automata, Languages and Programming, 2719:1022–37. Springer, 2003. https://doi.org/10.1007/3-540-45061-0_79.
ieee: L. De Alfaro, T. A. Henzinger, and R. Majumdar, “Discounting the future in
systems theory,” in Proceedings of the 30th International Colloquium on Automata,
Languages and Programming, Eindhoven, The Netherlands, 2003, vol. 2719, pp.
1022–1037.
ista: 'De Alfaro L, Henzinger TA, Majumdar R. 2003. Discounting the future in systems
theory. Proceedings of the 30th International Colloquium on Automata, Languages
and Programming. ICALP: Automata, Languages and Programming, LNCS, vol. 2719,
1022–1037.'
mla: De Alfaro, Luca, et al. “Discounting the Future in Systems Theory.” Proceedings
of the 30th International Colloquium on Automata, Languages and Programming,
vol. 2719, Springer, 2003, pp. 1022–37, doi:10.1007/3-540-45061-0_79.
short: L. De Alfaro, T.A. Henzinger, R. Majumdar, in:, Proceedings of the 30th International
Colloquium on Automata, Languages and Programming, Springer, 2003, pp. 1022–1037.
conference:
end_date: 2003-07-04
location: Eindhoven, The Netherlands
name: 'ICALP: Automata, Languages and Programming'
start_date: 2003-06-30
date_created: 2018-12-11T12:09:50Z
date_published: 2003-06-25T00:00:00Z
date_updated: 2023-07-26T13:07:31Z
day: '25'
doi: 10.1007/3-540-45061-0_79
extern: '1'
fulldoi: https://doi.org/10.1007/3-540-45061-0_79
intvolume: ' 2719'
language:
- iso: eng
month: '06'
oa_version: None
page: 1022 - 1037
publication: Proceedings of the 30th International Colloquium on Automata, Languages
and Programming
publication_identifier:
isbn:
- '9783540404934'
publication_status: published
publisher: Springer
publist_id: '77'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Discounting the future in systems theory
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2719
year: '2003'
...
---
_id: '4630'
abstract:
- lang: eng
text: We consider concurrent two-person games played in real time, in which the
players decide both which action to play, and when to play it. Such timed games
differ from untimed games in two essential ways. First, players can take each
other by surprise, because actions are played with delays that cannot be anticipated
by the opponent. Second, a player should not be able to win the game by preventing
time from diverging. We present a model of timed games that preserves the element
of surprise and accounts for time divergence in a way that treats both players
symmetrically and applies to all ω-regular winning conditions. We prove that the
ability to take each other by surprise adds extra power to the players. For the
case that the games are specified in the style of timed automata, we provide symbolic
algorithms for their solution with respect to all ω-regular winning conditions.
We also show that for these timed games, memory strategies are more powerful than
memoryless strategies already in the case of reachability objectives.
acknowledgement: Supported in part by the AFOSR MURI grant F49620-00-1-0327, the DARPA
grant F33615-C-98-3614, the MARCO grant 98-DT-660, -the ONR grant N00014-02-1-0671,
the NSF grants CCR-9988172, CCR-0225610, and CCR-0234690, the NSF CAREER award CCR-0132780,
and the MIUR grant MEFISTO.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Luca
full_name: De Alfaro, Luca
last_name: De Alfaro
- first_name: Marco
full_name: Faella, Marco
last_name: Faella
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000−0002−2985−7724
- first_name: Ritankar
full_name: Majumdar, Ritankar
last_name: Majumdar
- first_name: Mariëlle
full_name: Stoelinga, Mariëlle
last_name: Stoelinga
citation:
ama: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. The element
of surprise in timed games. In: Proceedings of the 14th International Conference
on Concurrency Theory. Vol 2761. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2003:144-158. doi:10.1007/978-3-540-45187-7_9'
apa: 'De Alfaro, L., Faella, M., Henzinger, T. A., Majumdar, R., & Stoelinga,
M. (2003). The element of surprise in timed games. In Proceedings of the 14th
International Conference on Concurrency Theory (Vol. 2761, pp. 144–158). Marseille,
France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/978-3-540-45187-7_9'
chicago: De Alfaro, Luca, Marco Faella, Thomas A Henzinger, Ritankar Majumdar, and
Mariëlle Stoelinga. “The Element of Surprise in Timed Games.” In Proceedings
of the 14th International Conference on Concurrency Theory, 2761:144–58. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003. https://doi.org/10.1007/978-3-540-45187-7_9.
ieee: L. De Alfaro, M. Faella, T. A. Henzinger, R. Majumdar, and M. Stoelinga, “The
element of surprise in timed games,” in Proceedings of the 14th International
Conference on Concurrency Theory, Marseille, France, 2003, vol. 2761, pp.
144–158.
ista: 'De Alfaro L, Faella M, Henzinger TA, Majumdar R, Stoelinga M. 2003. The element
of surprise in timed games. Proceedings of the 14th International Conference on
Concurrency Theory. CONCUR: Concurrency Theory, LNCS, vol. 2761, 144–158.'
mla: De Alfaro, Luca, et al. “The Element of Surprise in Timed Games.” Proceedings
of the 14th International Conference on Concurrency Theory, vol. 2761, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–58, doi:10.1007/978-3-540-45187-7_9.
short: L. De Alfaro, M. Faella, T.A. Henzinger, R. Majumdar, M. Stoelinga, in:,
Proceedings of the 14th International Conference on Concurrency Theory, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2003, pp. 144–158.
conference:
end_date: 2003-09-05
location: Marseille, France
name: 'CONCUR: Concurrency Theory'
start_date: 2003-09-03
date_created: 2018-12-11T12:09:51Z
date_published: 2003-08-21T00:00:00Z
date_updated: 2024-01-08T10:05:30Z
day: '21'
doi: 10.1007/978-3-540-45187-7_9
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-45187-7_9
intvolume: ' 2761'
language:
- iso: eng
month: '08'
oa_version: None
page: 144 - 158
publication: Proceedings of the 14th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783540407539'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
publist_id: '78'
quality_controlled: '1'
scopus_import: '1'
status: public
title: The element of surprise in timed games
type: conference
user_id: ea97e931-d5af-11eb-85d4-e6957dddbf17
volume: 2761
year: '2003'
...
---
OA_place: repository
OA_type: green
_id: '576'
abstract:
- lang: eng
text: 'We study the free expansion of a pancake-shaped Bose-condensed gas, which
is initially trapped under harmonic confinement and containing a vortex at its
centre. In the case of a radial expansion holding the axial confinement fixed
we consider various models for the interactions, depending on the thickness of
the condensate relative to the value of the scattering length. We are thus able
to evaluate different scattering regimes ranging from quasi-three-dimensional
(Q3D) to strictly two-dimensional (2D). We find that as the system goes from Q3D
to 2D the expansion rate of the condensate increases whereas that of the vortex
core decreases. In the Q3D scattering regime we also examine a fully free expansion
in 3D and find oscillatory behaviour for the vortex core radius: an initial fast
expansion of the vortex core is followed by a slowing down. Such a nonuniform
expansion rate of the vortex core implies that the timing of its observation should
be chosen appropriately.'
article_number: '2455'
article_processing_charge: No
article_type: original
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: Patrizia
full_name: Vignolo, Patrizia
last_name: Vignolo
- first_name: Anna
full_name: Minguzzi, Anna
last_name: Minguzzi
- first_name: Bilal
full_name: Tanatar, Bilal
last_name: Tanatar
- first_name: Mario
full_name: Tosi, Mario
last_name: Tosi
citation:
ama: 'Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. Free expansion of two-dimensional
condensates with a vortex. Journal of Physics B: Atomic, Molecular and Optical
Physics. 2003;36(12). doi:10.1088/0953-4075/36/12/306'
apa: 'Hosten, O., Vignolo, P., Minguzzi, A., Tanatar, B., & Tosi, M. (2003).
Free expansion of two-dimensional condensates with a vortex. Journal of Physics
B: Atomic, Molecular and Optical Physics. IOP Publishing . https://doi.org/10.1088/0953-4075/36/12/306'
chicago: 'Hosten, Onur, Patrizia Vignolo, Anna Minguzzi, Bilal Tanatar, and Mario
Tosi. “Free Expansion of Two-Dimensional Condensates with a Vortex.” Journal
of Physics B: Atomic, Molecular and Optical Physics. IOP Publishing , 2003.
https://doi.org/10.1088/0953-4075/36/12/306.'
ieee: 'O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, and M. Tosi, “Free expansion
of two-dimensional condensates with a vortex,” Journal of Physics B: Atomic,
Molecular and Optical Physics, vol. 36, no. 12. IOP Publishing , 2003.'
ista: 'Hosten O, Vignolo P, Minguzzi A, Tanatar B, Tosi M. 2003. Free expansion
of two-dimensional condensates with a vortex. Journal of Physics B: Atomic, Molecular
and Optical Physics. 36(12), 2455.'
mla: 'Hosten, Onur, et al. “Free Expansion of Two-Dimensional Condensates with a
Vortex.” Journal of Physics B: Atomic, Molecular and Optical Physics, vol.
36, no. 12, 2455, IOP Publishing , 2003, doi:10.1088/0953-4075/36/12/306.'
short: 'O. Hosten, P. Vignolo, A. Minguzzi, B. Tanatar, M. Tosi, Journal of Physics
B: Atomic, Molecular and Optical Physics 36 (2003).'
date_created: 2018-12-11T11:47:16Z
date_published: 2003-06-28T00:00:00Z
date_updated: 2026-05-28T14:23:40Z
day: '28'
doi: 10.1088/0953-4075/36/12/306
extern: '1'
external_id:
arxiv:
- '0303244'
fulldoi: https://doi.org/10.1088/0953-4075/36/12/306
intvolume: ' 36'
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.cond-mat/0303244'
month: '06'
oa: 1
oa_version: Preprint
publication: 'Journal of Physics B: Atomic, Molecular and Optical Physics'
publication_identifier:
eissn:
- 1361-6455
issn:
- 0953-4075
publication_status: published
publisher: 'IOP Publishing '
publist_id: '7239'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Free expansion of two-dimensional condensates with a vortex
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 36
year: '2003'
...
---
_id: '6156'
abstract:
- lang: eng
text: 'Social and solitary feeding in natural Caenorhabditis elegans isolates are
associated with two alleles of the orphan G-protein-coupled receptor (GPCR) NPR-1:
social feeders contain NPR-1 215F, whereas solitary feeders contain NPR-1 215V.
Here we identify FMRFamide-related neuropeptides (FaRPs) encoded by the flp-18
and flp-21 genes as NPR-1 ligands and show that these peptides can differentially
activate the NPR-1 215F and NPR-1 215V receptors. Multicopy overexpression of
flp-21 transformed wild social animals into solitary feeders. Conversely, a flp-21
deletion partially phenocopied the npr-1(null) phenotype, which is consistent
with NPR-1 activation by FLP-21 in vivo but also implicates other ligands for
NPR-1. Phylogenetic studies indicate that the dominant npr-1 215V allele likely
arose from an ancestral npr-1 215F gene in C. elegans. Our data suggest a model
in which solitary feeding evolved in an ancestral social strain of C. elegans
by a gain-of-function mutation that modified the response of NPR-1 to FLP-18 and
FLP-21 ligands.'
author:
- first_name: Candida
full_name: Rogers, Candida
last_name: Rogers
- first_name: Vincenzina
full_name: Reale, Vincenzina
last_name: Reale
- first_name: Kyuhyung
full_name: Kim, Kyuhyung
last_name: Kim
- first_name: Heather
full_name: Chatwin, Heather
last_name: Chatwin
- first_name: Chris
full_name: Li, Chris
last_name: Li
- first_name: Peter
full_name: Evans, Peter
last_name: Evans
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: Rogers C, Reale V, Kim K, et al. Inhibition of Caenorhabditis elegans social
feeding by FMRFamide-related peptide activation of NPR-1. Nature Neuroscience.
2003;6(11):1178-1185. doi:10.1038/nn1140
apa: Rogers, C., Reale, V., Kim, K., Chatwin, H., Li, C., Evans, P., & de Bono,
M. (2003). Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related
peptide activation of NPR-1. Nature Neuroscience. Springer Nature. https://doi.org/10.1038/nn1140
chicago: Rogers, Candida, Vincenzina Reale, Kyuhyung Kim, Heather Chatwin, Chris
Li, Peter Evans, and Mario de Bono. “Inhibition of Caenorhabditis Elegans Social
Feeding by FMRFamide-Related Peptide Activation of NPR-1.” Nature Neuroscience.
Springer Nature, 2003. https://doi.org/10.1038/nn1140.
ieee: C. Rogers et al., “Inhibition of Caenorhabditis elegans social feeding
by FMRFamide-related peptide activation of NPR-1,” Nature Neuroscience,
vol. 6, no. 11. Springer Nature, pp. 1178–1185, 2003.
ista: Rogers C, Reale V, Kim K, Chatwin H, Li C, Evans P, de Bono M. 2003. Inhibition
of Caenorhabditis elegans social feeding by FMRFamide-related peptide activation
of NPR-1. Nature Neuroscience. 6(11), 1178–1185.
mla: Rogers, Candida, et al. “Inhibition of Caenorhabditis Elegans Social Feeding
by FMRFamide-Related Peptide Activation of NPR-1.” Nature Neuroscience,
vol. 6, no. 11, Springer Nature, 2003, pp. 1178–85, doi:10.1038/nn1140.
short: C. Rogers, V. Reale, K. Kim, H. Chatwin, C. Li, P. Evans, M. de Bono, Nature
Neuroscience 6 (2003) 1178–1185.
date_created: 2019-03-21T09:47:53Z
date_published: 2003-10-12T00:00:00Z
date_updated: 2021-01-12T08:06:25Z
day: '12'
doi: 10.1038/nn1140
extern: '1'
external_id:
pmid:
- '14555955'
fulldoi: https://doi.org/10.1038/nn1140
intvolume: ' 6'
issue: '11'
language:
- iso: eng
month: '10'
oa_version: None
page: 1178-1185
pmid: 1
publication: Nature Neuroscience
publication_identifier:
issn:
- 1097-6256
- 1546-1726
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Inhibition of Caenorhabditis elegans social feeding by FMRFamide-related peptide
activation of NPR-1
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2003'
...
---
_id: '6157'
abstract:
- lang: eng
text: In many animal species individuals aggregate to live in groups. A range of
experimental approaches in different animals, including studies of social feeding
in nematodes, maternal behavior in rats and sheep, and pair-bonding in voles,
are providing insights into the neural bases for these behaviors. These studies
are delineating multiple neural circuits and gene networks in the brain that interact
in ways that are as yet poorly understood to coordinate social behavior.
author:
- first_name: Mario
full_name: de Bono, Mario
id: 4E3FF80E-F248-11E8-B48F-1D18A9856A87
last_name: de Bono
orcid: 0000-0001-8347-0443
citation:
ama: de Bono M. Molecular approaches to aggregation behavior and social attachment.
Journal of Neurobiology. 2003;54(1):78-92. doi:10.1002/neu.10162
apa: de Bono, M. (2003). Molecular approaches to aggregation behavior and social
attachment. Journal of Neurobiology. Wiley. https://doi.org/10.1002/neu.10162
chicago: Bono, Mario de. “Molecular Approaches to Aggregation Behavior and Social
Attachment.” Journal of Neurobiology. Wiley, 2003. https://doi.org/10.1002/neu.10162.
ieee: M. de Bono, “Molecular approaches to aggregation behavior and social attachment,”
Journal of Neurobiology, vol. 54, no. 1. Wiley, pp. 78–92, 2003.
ista: de Bono M. 2003. Molecular approaches to aggregation behavior and social attachment.
Journal of Neurobiology. 54(1), 78–92.
mla: de Bono, Mario. “Molecular Approaches to Aggregation Behavior and Social Attachment.”
Journal of Neurobiology, vol. 54, no. 1, Wiley, 2003, pp. 78–92, doi:10.1002/neu.10162.
short: M. de Bono, Journal of Neurobiology 54 (2003) 78–92.
date_created: 2019-03-21T09:52:31Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2021-01-12T08:06:26Z
day: '01'
doi: 10.1002/neu.10162
extern: '1'
external_id:
pmid:
- '12486699'
fulldoi: https://doi.org/10.1002/neu.10162
intvolume: ' 54'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 78-92
pmid: 1
publication: Journal of Neurobiology
publication_identifier:
issn:
- 0022-3034
- 1097-4695
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Molecular approaches to aggregation behavior and social attachment
type: journal_article
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 54
year: '2003'
...
---
OA_type: closed access
_id: '205'
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Browning TD. Counting rational points on cubic and quartic surfaces. Acta
Arithmetica. 2003;108:275-295. doi:10.4064/aa108-3-7
apa: Browning, T. D. (2003). Counting rational points on cubic and quartic surfaces.
Acta Arithmetica. Instytut Matematyczny. https://doi.org/10.4064/aa108-3-7
chicago: Browning, Timothy D. “Counting Rational Points on Cubic and Quartic Surfaces.”
Acta Arithmetica. Instytut Matematyczny, 2003. https://doi.org/10.4064/aa108-3-7.
ieee: T. D. Browning, “Counting rational points on cubic and quartic surfaces,”
Acta Arithmetica, vol. 108. Instytut Matematyczny, pp. 275–295, 2003.
ista: Browning TD. 2003. Counting rational points on cubic and quartic surfaces.
Acta Arithmetica. 108, 275–295.
mla: Browning, Timothy D. “Counting Rational Points on Cubic and Quartic Surfaces.”
Acta Arithmetica, vol. 108, Instytut Matematyczny, 2003, pp. 275–95, doi:10.4064/aa108-3-7.
short: T.D. Browning, Acta Arithmetica 108 (2003) 275–295.
date_created: 2018-12-11T11:45:12Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2026-05-29T07:22:53Z
day: '01'
doi: 10.4064/aa108-3-7
extern: '1'
fulldoi: https://doi.org/10.4064/aa108-3-7
intvolume: ' 108'
language:
- iso: eng
month: '01'
oa_version: None
page: 275 - 295
publication: Acta Arithmetica
publication_identifier:
eissn:
- 1730-6264
issn:
- 0065-1036
publication_status: published
publisher: Instytut Matematyczny
publist_id: '7707'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Counting rational points on cubic and quartic surfaces
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 108
year: '2003'
...
---
OA_type: closed access
_id: '206'
abstract:
- lang: eng
text: Let T ⊂ ℙ 4 be a non-singular threefold of degree at least four. Then we show
that the number of points in T(ℚ), with height at most B, is o(B 3) or B → ∞.
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Browning TD. A note on the distribution of rational points on threefolds. Quarterly
Journal of Mathematics. 2003;54(1):33-39. doi:10.1093/qjmath/54.1.33
apa: Browning, T. D. (2003). A note on the distribution of rational points on threefolds.
Quarterly Journal of Mathematics. Unknown. https://doi.org/10.1093/qjmath/54.1.33
chicago: Browning, Timothy D. “A Note on the Distribution of Rational Points on
Threefolds.” Quarterly Journal of Mathematics. Unknown, 2003. https://doi.org/10.1093/qjmath/54.1.33.
ieee: T. D. Browning, “A note on the distribution of rational points on threefolds,”
Quarterly Journal of Mathematics, vol. 54, no. 1. Unknown, pp. 33–39, 2003.
ista: Browning TD. 2003. A note on the distribution of rational points on threefolds.
Quarterly Journal of Mathematics. 54(1), 33–39.
mla: Browning, Timothy D. “A Note on the Distribution of Rational Points on Threefolds.”
Quarterly Journal of Mathematics, vol. 54, no. 1, Unknown, 2003, pp. 33–39,
doi:10.1093/qjmath/54.1.33.
short: T.D. Browning, Quarterly Journal of Mathematics 54 (2003) 33–39.
date_created: 2018-12-11T11:45:12Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2026-05-29T07:14:27Z
day: '01'
doi: 10.1093/qjmath/54.1.33
extern: '1'
fulldoi: https://doi.org/10.1093/qjmath/54.1.33
intvolume: ' 54'
issue: '1'
language:
- iso: eng
month: '03'
oa_version: None
page: 33 - 39
publication: Quarterly Journal of Mathematics
publication_identifier:
eissn:
- 1464-3847
issn:
- 0033-5606
publication_status: published
publisher: Unknown
publist_id: '7706'
quality_controlled: '1'
scopus_import: '1'
status: public
title: A note on the distribution of rational points on threefolds
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 54
year: '2003'
...
---
_id: '207'
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Browning TD. Sums of four biquadrates. Mathematical Proceedings of the Cambridge
Philosophical Society. 2003;134(3):385-395. doi:10.1017/S0305004102006382
apa: Browning, T. D. (2003). Sums of four biquadrates. Mathematical Proceedings
of the Cambridge Philosophical Society. Cambridge University Press. https://doi.org/10.1017/S0305004102006382
chicago: Browning, Timothy D. “Sums of Four Biquadrates.” Mathematical Proceedings
of the Cambridge Philosophical Society. Cambridge University Press, 2003.
https://doi.org/10.1017/S0305004102006382.
ieee: T. D. Browning, “Sums of four biquadrates,” Mathematical Proceedings of
the Cambridge Philosophical Society, vol. 134, no. 3. Cambridge University
Press, pp. 385–395, 2003.
ista: Browning TD. 2003. Sums of four biquadrates. Mathematical Proceedings of the
Cambridge Philosophical Society. 134(3), 385–395.
mla: Browning, Timothy D. “Sums of Four Biquadrates.” Mathematical Proceedings
of the Cambridge Philosophical Society, vol. 134, no. 3, Cambridge University
Press, 2003, pp. 385–95, doi:10.1017/S0305004102006382.
short: T.D. Browning, Mathematical Proceedings of the Cambridge Philosophical Society
134 (2003) 385–395.
date_created: 2018-12-11T11:45:12Z
date_published: 2003-05-01T00:00:00Z
date_updated: 2021-01-12T06:55:07Z
day: '01'
doi: 10.1017/S0305004102006382
extern: '1'
fulldoi: https://doi.org/10.1017/S0305004102006382
intvolume: ' 134'
issue: '3'
language:
- iso: eng
month: '05'
oa_version: None
page: 385 - 395
publication: Mathematical Proceedings of the Cambridge Philosophical Society
publication_status: published
publisher: Cambridge University Press
publist_id: '7704'
quality_controlled: '1'
status: public
title: Sums of four biquadrates
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 134
year: '2003'
...
---
OA_type: closed access
_id: '208'
abstract:
- lang: eng
text: "For any ε > 0 and any diagonal quadratic form Q ∈ Z[x1, x2, x3, x4] with
a square‐free discriminant of modulus ΔQ ≠ 0, we establish the uniform estimate
≪ε B3/2+ε + B2+ε/Δ1/6Q for the number of rational points of height at most B lying
in the projective surface Q = 0.\r\n\r\n"
article_processing_charge: No
article_type: original
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: Browning TD. Counting rational points on diagonal quadratic surfaces. Quarterly
Journal of Mathematics. 2003;54(1):11-31. doi:doi/10.1093/qjmath/54.1.11
apa: Browning, T. D. (2003). Counting rational points on diagonal quadratic surfaces.
Quarterly Journal of Mathematics. Oxford Academic. https://doi.org/doi/10.1093/qjmath/54.1.11
chicago: Browning, Timothy D. “Counting Rational Points on Diagonal Quadratic Surfaces.”
Quarterly Journal of Mathematics. Oxford Academic, 2003. https://doi.org/doi/10.1093/qjmath/54.1.11.
ieee: T. D. Browning, “Counting rational points on diagonal quadratic surfaces,”
Quarterly Journal of Mathematics, vol. 54, no. 1. Oxford Academic, pp.
11–31, 2003.
ista: Browning TD. 2003. Counting rational points on diagonal quadratic surfaces.
Quarterly Journal of Mathematics. 54(1), 11–31.
mla: Browning, Timothy D. “Counting Rational Points on Diagonal Quadratic Surfaces.”
Quarterly Journal of Mathematics, vol. 54, no. 1, Oxford Academic, 2003,
pp. 11–31, doi:doi/10.1093/qjmath/54.1.11.
short: T.D. Browning, Quarterly Journal of Mathematics 54 (2003) 11–31.
date_created: 2018-12-11T11:45:13Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2026-05-29T07:10:52Z
day: '01'
doi: doi/10.1093/qjmath/54.1.11
extern: '1'
fulldoi: https://doi.org/doi/10.1093/qjmath/54.1.11
intvolume: ' 54'
issue: '1'
language:
- iso: eng
month: '03'
oa_version: None
page: 11 - 31
publication: Quarterly Journal of Mathematics
publication_identifier:
eissn:
- 1464-3847
issn:
- 0033-5606
publication_status: published
publisher: Oxford Academic
publist_id: '7705'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Counting rational points on diagonal quadratic surfaces
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 54
year: '2003'
...
---
OA_type: closed access
_id: '847'
abstract:
- lang: eng
text: The accumulation of genome-wide information on single nucleotide polymorphisms
in humans provides an unprecedented opportunity to detect the evolutionary forces
responsible for heterogeneity of the level of genetic variability across loci.
Previous studies have shown that history of recombination events has produced
long haplotype blocks in the human genome, which contribute to this heterogeneity.
Other factors, however, such as natural selection or the heterogeneity of mutation
rates across loci, may also lead to heterogeneity of genetic variability. We compared
synonymous and non-synonymous variability within human genes with their divergence
from murine orthologs. We separately analyzed the non-synonymous variants predicted
to damage protein structure or function and the variants predicted to be functionally
benign. The predictions were based on comparative sequence analysis and, in some
cases, on the analysis of protein structure. A strong correlation between non-synonymous,
benign variability and non-synonymous human-mouse divergence suggests that selection
played an important role in shaping the pattern of variability in coding regions
of human genes. However, the lack of correlation between deleterious variability
and evolutionary divergence shows that a substantial proportion of the observed
non-synonymous single-nucleotide polymorphisms reduces fitness and never reaches
fixation. Evolutionary and medical implications of the impact of selection on
human polymorphisms are discussed.
acknowledgement: We are grateful to Alexey Kondrashov and Alison Wellman for the careful
reading of the manuscript and providing us with their valuable comments.
article_processing_charge: No
article_type: original
author:
- first_name: Shamil
full_name: Sunyaev, Shamil
last_name: Sunyaev
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Peer
full_name: Bork, Peer
last_name: Bork
- first_name: Vasily
full_name: Ramensky, Vasily
last_name: Ramensky
citation:
ama: Sunyaev S, Kondrashov F, Bork P, Ramensky V. Impact of selection, mutation
rate and genetic drift on human genetic variation. Human Molecular Genetics.
2003;12(24):3325-3330. doi:10.1093/hmg/ddg359
apa: Sunyaev, S., Kondrashov, F., Bork, P., & Ramensky, V. (2003). Impact of
selection, mutation rate and genetic drift on human genetic variation. Human
Molecular Genetics. Oxford Academic. https://doi.org/10.1093/hmg/ddg359
chicago: Sunyaev, Shamil, Fyodor Kondrashov, Peer Bork, and Vasily Ramensky. “Impact
of Selection, Mutation Rate and Genetic Drift on Human Genetic Variation.” Human
Molecular Genetics. Oxford Academic, 2003. https://doi.org/10.1093/hmg/ddg359.
ieee: S. Sunyaev, F. Kondrashov, P. Bork, and V. Ramensky, “Impact of selection,
mutation rate and genetic drift on human genetic variation,” Human Molecular
Genetics, vol. 12, no. 24. Oxford Academic, pp. 3325–3330, 2003.
ista: Sunyaev S, Kondrashov F, Bork P, Ramensky V. 2003. Impact of selection, mutation
rate and genetic drift on human genetic variation. Human Molecular Genetics. 12(24),
3325–3330.
mla: Sunyaev, Shamil, et al. “Impact of Selection, Mutation Rate and Genetic Drift
on Human Genetic Variation.” Human Molecular Genetics, vol. 12, no. 24,
Oxford Academic, 2003, pp. 3325–30, doi:10.1093/hmg/ddg359.
short: S. Sunyaev, F. Kondrashov, P. Bork, V. Ramensky, Human Molecular Genetics
12 (2003) 3325–3330.
date_created: 2018-12-11T11:48:49Z
date_published: 2003-12-15T00:00:00Z
date_updated: 2026-05-28T14:13:45Z
day: '15'
doi: 10.1093/hmg/ddg359
extern: '1'
external_id:
pmid:
- '14570704 '
fulldoi: https://doi.org/10.1093/hmg/ddg359
intvolume: ' 12'
issue: '24'
language:
- iso: eng
month: '12'
oa_version: None
page: 3325 - 3330
pmid: 1
publication: Human Molecular Genetics
publication_identifier:
eissn:
- 1460-2083
issn:
- 0964-6906
publication_status: published
publisher: Oxford Academic
publist_id: '6803'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Impact of selection, mutation rate and genetic drift on human genetic variation
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 12
year: '2003'
...
---
_id: '8519'
article_processing_charge: No
article_type: original
author:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
citation:
ama: Kaloshin V. The existential Hilbert 16-th problem and an estimate for cyclicity
of elementary polycycles. Inventiones mathematicae. 2003;151(3):451-512.
doi:10.1007/s00222-002-0244-9
apa: Kaloshin, V. (2003). The existential Hilbert 16-th problem and an estimate
for cyclicity of elementary polycycles. Inventiones Mathematicae. Springer
Nature. https://doi.org/10.1007/s00222-002-0244-9
chicago: Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate
for Cyclicity of Elementary Polycycles.” Inventiones Mathematicae. Springer
Nature, 2003. https://doi.org/10.1007/s00222-002-0244-9.
ieee: V. Kaloshin, “The existential Hilbert 16-th problem and an estimate for cyclicity
of elementary polycycles,” Inventiones mathematicae, vol. 151, no. 3. Springer
Nature, pp. 451–512, 2003.
ista: Kaloshin V. 2003. The existential Hilbert 16-th problem and an estimate for
cyclicity of elementary polycycles. Inventiones mathematicae. 151(3), 451–512.
mla: Kaloshin, Vadim. “The Existential Hilbert 16-Th Problem and an Estimate for
Cyclicity of Elementary Polycycles.” Inventiones Mathematicae, vol. 151,
no. 3, Springer Nature, 2003, pp. 451–512, doi:10.1007/s00222-002-0244-9.
short: V. Kaloshin, Inventiones Mathematicae 151 (2003) 451–512.
date_created: 2020-09-18T10:49:26Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2021-01-12T08:19:50Z
day: '01'
doi: 10.1007/s00222-002-0244-9
extern: '1'
fulldoi: https://doi.org/10.1007/s00222-002-0244-9
intvolume: ' 151'
issue: '3'
keyword:
- General Mathematics
language:
- iso: eng
month: '03'
oa_version: None
page: 451-512
publication: Inventiones mathematicae
publication_identifier:
issn:
- 0020-9910
- 1432-1297
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: The existential Hilbert 16-th problem and an estimate for cyclicity of elementary
polycycles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 151
year: '2003'
...
---
OA_type: closed access
_id: '876'
abstract:
- lang: eng
text: Alternative splicing is thought to be a major source of functional diversity
in animal proteins. We analyzed the evolutionary conservation of proteins encoded
by alternatively spliced genes and predicted the ancestral state for 73 cases
of alternative splicing (25 insertions and 48 deletions). The amino acid sequences
of most of the inserts in proteins produced by alternative splicing are as conserved
as the surrounding sequences. Thus, alternative splicing often creates novel isoforms
by the insertion of new, functional protein sequences that probably originated
from noncoding sequences of introns.
acknowledgement: We thank Peer Bork, Mikhail Gelfand, Alexey Kondrashov, David Lipman
and Shamil Sunyaev for critical reading of the manuscript and useful suggestions
and the Koonin group members for helpful discussions.
article_processing_charge: No
article_type: original
author:
- first_name: Fyodor
full_name: Kondrashov, Fyodor
id: 44FDEF62-F248-11E8-B48F-1D18A9856A87
last_name: Kondrashov
orcid: 0000-0001-8243-4694
- first_name: Eugene
full_name: Koonin, Eugene
last_name: Koonin
citation:
ama: 'Kondrashov F, Koonin E. Evolution of alternative splicing: Deletions, insertions
and origin of functional parts of proteins from intron sequences. Trends in
Genetics. 2003;19(3):115-119. doi:10.1016/S0168-9525(02)00029-X'
apa: 'Kondrashov, F., & Koonin, E. (2003). Evolution of alternative splicing:
Deletions, insertions and origin of functional parts of proteins from intron sequences.
Trends in Genetics. Elsevier. https://doi.org/10.1016/S0168-9525(02)00029-X'
chicago: 'Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing:
Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.”
Trends in Genetics. Elsevier, 2003. https://doi.org/10.1016/S0168-9525(02)00029-X.'
ieee: 'F. Kondrashov and E. Koonin, “Evolution of alternative splicing: Deletions,
insertions and origin of functional parts of proteins from intron sequences,”
Trends in Genetics, vol. 19, no. 3. Elsevier, pp. 115–119, 2003.'
ista: 'Kondrashov F, Koonin E. 2003. Evolution of alternative splicing: Deletions,
insertions and origin of functional parts of proteins from intron sequences. Trends
in Genetics. 19(3), 115–119.'
mla: 'Kondrashov, Fyodor, and Eugene Koonin. “Evolution of Alternative Splicing:
Deletions, Insertions and Origin of Functional Parts of Proteins from Intron Sequences.”
Trends in Genetics, vol. 19, no. 3, Elsevier, 2003, pp. 115–19, doi:10.1016/S0168-9525(02)00029-X.'
short: F. Kondrashov, E. Koonin, Trends in Genetics 19 (2003) 115–119.
date_created: 2018-12-11T11:48:58Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2026-05-28T13:49:56Z
day: '01'
doi: 10.1016/S0168-9525(02)00029-X
extern: '1'
external_id:
pmid:
- '12615001'
fulldoi: https://doi.org/10.1016/S0168-9525(02)00029-X
intvolume: ' 19'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 115 - 119
pmid: 1
publication: Trends in Genetics
publication_identifier:
eissn:
- 1362-4555
issn:
- 0168-9525
publication_status: published
publisher: Elsevier
publist_id: '6776'
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Evolution of alternative splicing: Deletions, insertions and origin of functional
parts of proteins from intron sequences'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 19
year: '2003'
...
---
_id: '9455'
abstract:
- lang: eng
text: Proteins of the ARGONAUTE family are important in diverse posttranscriptional
RNA-mediated gene-silencing systems as well as in transcriptional gene silencing
in Drosophila and fission yeast and in programmed DNA elimination in Tetrahymena.
We cloned ARGONAUTE4 (AGO4) from a screen for mutants that suppress silencing
of the Arabidopsis SUPERMAN(SUP) gene. The ago4-1 mutant reactivated silentSUP
alleles and decreased CpNpG and asymmetric DNA methylation as well as histone
H3 lysine-9 methylation. In addition,ago4-1 blocked histone and DNA methylation
and the accumulation of 25-nucleotide small interfering RNAs (siRNAs) that correspond
to the retroelement AtSN1. These results suggest that AGO4 and long siRNAs direct
chromatin modifications, including histone methylation and non-CpG DNA methylation.
article_processing_charge: No
article_type: original
author:
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: ' Xiaofeng'
full_name: Cao, Xiaofeng
last_name: Cao
- first_name: Steven E.
full_name: Jacobsen, Steven E.
last_name: Jacobsen
citation:
ama: Zilberman D, Cao Xiaofeng, Jacobsen SE. ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation. Science. 2003;299(5607):716-719.
doi:10.1126/science.1079695
apa: Zilberman, D., Cao, Xiaofeng, & Jacobsen, S. E. (2003). ARGONAUTE4 control
of locus-specific siRNA accumulation and DNA and histone methylation. Science.
American Association for the Advancement of Science. https://doi.org/10.1126/science.1079695
chicago: Zilberman, Daniel, Xiaofeng Cao, and Steven E. Jacobsen. “ARGONAUTE4 Control
of Locus-Specific SiRNA Accumulation and DNA and Histone Methylation.” Science.
American Association for the Advancement of Science, 2003. https://doi.org/10.1126/science.1079695.
ieee: D. Zilberman, Xiaofeng Cao, and S. E. Jacobsen, “ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation,” Science, vol. 299,
no. 5607. American Association for the Advancement of Science, pp. 716–719, 2003.
ista: Zilberman D, Cao Xiaofeng, Jacobsen SE. 2003. ARGONAUTE4 control of locus-specific
siRNA accumulation and DNA and histone methylation. Science. 299(5607), 716–719.
mla: Zilberman, Daniel, et al. “ARGONAUTE4 Control of Locus-Specific SiRNA Accumulation
and DNA and Histone Methylation.” Science, vol. 299, no. 5607, American
Association for the Advancement of Science, 2003, pp. 716–19, doi:10.1126/science.1079695.
short: D. Zilberman, Xiaofeng Cao, S.E. Jacobsen, Science 299 (2003) 716–719.
date_created: 2021-06-04T11:26:26Z
date_published: 2003-01-31T00:00:00Z
date_updated: 2021-12-14T08:43:30Z
day: '31'
department:
- _id: DaZi
doi: 10.1126/science.1079695
extern: '1'
external_id:
pmid:
- '12522258'
fulldoi: https://doi.org/10.1126/science.1079695
intvolume: ' 299'
issue: '5607'
keyword:
- Multidisciplinary
language:
- iso: eng
month: '01'
oa_version: None
page: 716-719
pmid: 1
publication: Science
publication_identifier:
eissn:
- 1095-9203
issn:
- 0036-8075
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
scopus_import: '1'
status: public
title: ARGONAUTE4 control of locus-specific siRNA accumulation and DNA and histone
methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 299
year: '2003'
...
---
_id: '9495'
abstract:
- lang: eng
text: RNA interference is a conserved process in which double-stranded RNA is processed
into 21–25 nucleotide siRNAs that trigger posttranscriptional gene silencing.
In addition, plants display a phenomenon termed RNA-directed DNA methylation (RdDM)
in which DNA with sequence identity to silenced RNA is de novo methylated at its
cytosine residues. This methylation is not only at canonical CpG sites but also
at cytosines in CpNpG and asymmetric sequence contexts. In this report, we study
the role of the DRM and CMT3 DNA methyltransferase genes in the initiation and
maintenance of RdDM. Neither drm nor cmt3 mutants affected the maintenance of
preestablished RNA-directed CpG methylation. However, drm mutants showed a nearly
complete loss of asymmetric methylation and a partial loss of CpNpG methylation.
The remaining asymmetric and CpNpG methylation was dependent on the activity of
CMT3, showing that DRM and CMT3 act redundantly to maintain non-CpG methylation.
These DNA methyltransferases appear to act downstream of siRNAs, since drm1 drm2
cmt3 triple mutants show a lack of non-CpG methylation but elevated levels of
siRNAs. Finally, we demonstrate that DRM activity is required for the initial
establishment of RdDM in all sequence contexts including CpG, CpNpG, and asymmetric
sites.
article_processing_charge: No
article_type: original
author:
- first_name: Xiaofeng
full_name: Cao, Xiaofeng
last_name: Cao
- first_name: Werner
full_name: Aufsatz, Werner
last_name: Aufsatz
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
- first_name: M.Florian
full_name: Mette, M.Florian
last_name: Mette
- first_name: Michael S.
full_name: Huang, Michael S.
last_name: Huang
- first_name: Marjori
full_name: Matzke, Marjori
last_name: Matzke
- first_name: Steven E.
full_name: Jacobsen, Steven E.
last_name: Jacobsen
citation:
ama: Cao X, Aufsatz W, Zilberman D, et al. Role of the DRM and CMT3 methyltransferases
in RNA-directed DNA methylation. Current Biology. 2003;13(24):2212-2217.
doi:10.1016/j.cub.2003.11.052
apa: Cao, X., Aufsatz, W., Zilberman, D., Mette, M. F., Huang, M. S., Matzke, M.,
& Jacobsen, S. E. (2003). Role of the DRM and CMT3 methyltransferases in RNA-directed
DNA methylation. Current Biology. Elsevier. https://doi.org/10.1016/j.cub.2003.11.052
chicago: Cao, Xiaofeng, Werner Aufsatz, Daniel Zilberman, M.Florian Mette, Michael
S. Huang, Marjori Matzke, and Steven E. Jacobsen. “Role of the DRM and CMT3 Methyltransferases
in RNA-Directed DNA Methylation.” Current Biology. Elsevier, 2003. https://doi.org/10.1016/j.cub.2003.11.052.
ieee: X. Cao et al., “Role of the DRM and CMT3 methyltransferases in RNA-directed
DNA methylation,” Current Biology, vol. 13, no. 24. Elsevier, pp. 2212–2217,
2003.
ista: Cao X, Aufsatz W, Zilberman D, Mette MF, Huang MS, Matzke M, Jacobsen SE.
2003. Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation.
Current Biology. 13(24), 2212–2217.
mla: Cao, Xiaofeng, et al. “Role of the DRM and CMT3 Methyltransferases in RNA-Directed
DNA Methylation.” Current Biology, vol. 13, no. 24, Elsevier, 2003, pp.
2212–17, doi:10.1016/j.cub.2003.11.052.
short: X. Cao, W. Aufsatz, D. Zilberman, M.F. Mette, M.S. Huang, M. Matzke, S.E.
Jacobsen, Current Biology 13 (2003) 2212–2217.
date_created: 2021-06-07T10:43:02Z
date_published: 2003-12-16T00:00:00Z
date_updated: 2021-12-14T08:41:38Z
day: '16'
department:
- _id: DaZi
doi: 10.1016/j.cub.2003.11.052
extern: '1'
external_id:
pmid:
- '14680640'
fulldoi: https://doi.org/10.1016/j.cub.2003.11.052
intvolume: ' 13'
issue: '24'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.cub.2003.11.052
month: '12'
oa: 1
oa_version: Published Version
page: 2212-2217
pmid: 1
publication: Current Biology
publication_identifier:
eissn:
- 1879-0445
issn:
- 0960-9822
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Role of the DRM and CMT3 methyltransferases in RNA-directed DNA methylation
type: journal_article
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
volume: 13
year: '2003'
...
---
OA_type: closed access
_id: '3139'
article_processing_charge: No
author:
- first_name: Hsiao
full_name: Chen, Hsiao
last_name: Chen
- first_name: Simon
full_name: Hippenmeyer, Simon
id: 37B36620-F248-11E8-B48F-1D18A9856A87
last_name: Hippenmeyer
orcid: 0000-0003-2279-1061
- first_name: Silvia
full_name: Arber, Silvia
last_name: Arber
- first_name: Eric
full_name: Frank, Eric
last_name: Frank
citation:
ama: Chen H, Hippenmeyer S, Arber S, Frank E. Development of the monosynaptic stretch
reflex circuit. Current Opinion in Neurobiology. 2003;13(1):96-102. doi:10.1016/S0959-4388(03)00006-0
apa: Chen, H., Hippenmeyer, S., Arber, S., & Frank, E. (2003). Development of
the monosynaptic stretch reflex circuit. Current Opinion in Neurobiology.
Elsevier. https://doi.org/10.1016/S0959-4388(03)00006-0
chicago: Chen, Hsiao, Simon Hippenmeyer, Silvia Arber, and Eric Frank. “Development
of the Monosynaptic Stretch Reflex Circuit.” Current Opinion in Neurobiology.
Elsevier, 2003. https://doi.org/10.1016/S0959-4388(03)00006-0.
ieee: H. Chen, S. Hippenmeyer, S. Arber, and E. Frank, “Development of the monosynaptic
stretch reflex circuit,” Current Opinion in Neurobiology, vol. 13, no.
1. Elsevier, pp. 96–102, 2003.
ista: Chen H, Hippenmeyer S, Arber S, Frank E. 2003. Development of the monosynaptic
stretch reflex circuit. Current Opinion in Neurobiology. 13(1), 96–102.
mla: Chen, Hsiao, et al. “Development of the Monosynaptic Stretch Reflex Circuit.”
Current Opinion in Neurobiology, vol. 13, no. 1, Elsevier, 2003, pp. 96–102,
doi:10.1016/S0959-4388(03)00006-0.
short: H. Chen, S. Hippenmeyer, S. Arber, E. Frank, Current Opinion in Neurobiology
13 (2003) 96–102.
date_created: 2018-12-11T12:01:37Z
date_published: 2003-02-01T00:00:00Z
date_updated: 2026-05-22T08:40:52Z
day: '01'
doi: 10.1016/S0959-4388(03)00006-0
extern: '1'
external_id:
pmid:
- '12593987'
fulldoi: https://doi.org/10.1016/S0959-4388(03)00006-0
intvolume: ' 13'
issue: '1'
language:
- iso: eng
month: '02'
oa_version: None
page: 96 - 102
pmid: 1
publication: Current Opinion in Neurobiology
publication_identifier:
eissn:
- 1873-6882
issn:
- 0959-4388
publication_status: published
publisher: Elsevier
publist_id: '3557'
status: public
title: Development of the monosynaptic stretch reflex circuit
type: review
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 13
year: '2003'
...
---
OA_type: closed access
_id: '3150'
abstract:
- lang: eng
text: Tripartite G-protein-coupled receptors (GPCRs) represent one of the largest
groups of signal transducers, transmitting signals from hormones, neuropeptides,
odorants, food and light. Ligand-bound receptors catalyse GDP/GTP exchange on
the G-protein α-subunit (Gα), leading to α-GTP separation from the βγ subunits
and pathway activation. Activating mutations in the receptors or G proteins underlie
many human diseases, including some cancers, dwarfism and premature puberty. Regulators
of G-protein signalling (RGS proteins) are known to modulate the level and duration
of ligand-induced signalling by accelerating the intrinsic GTPase activity of
the Gα subunit, and thus reformation of the inactive GDP-bound Gα. Here we find
that even in the absence of receptor, mutation of the RGS family member Sst2 (refs
6-9) permits spontaneous activation of the G-protein-coupled mating pathway in
Saccharomyces cerevisiae at levels normally seen only in the presence of ligand.
Our work demonstrates the occurence of spontaneous tripartite G-protein signalling
in vivo and identifies a requirement for RGS proteins in preventing such receptor-independent
activation.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: David
full_name: Drubin, David
last_name: Drubin
citation:
ama: Siekhaus DE, Drubin D. Spontaneous receptor-independent heterotrimeric G-protein
signalling in an RGS mutant. Nature Cell Biology. 2003;5(3):231-235. doi:10.1038/ncb941
apa: Siekhaus, D. E., & Drubin, D. (2003). Spontaneous receptor-independent
heterotrimeric G-protein signalling in an RGS mutant. Nature Cell Biology.
Springer Nature. https://doi.org/10.1038/ncb941
chicago: Siekhaus, Daria E, and David Drubin. “Spontaneous Receptor-Independent
Heterotrimeric G-Protein Signalling in an RGS Mutant.” Nature Cell Biology.
Springer Nature, 2003. https://doi.org/10.1038/ncb941.
ieee: D. E. Siekhaus and D. Drubin, “Spontaneous receptor-independent heterotrimeric
G-protein signalling in an RGS mutant,” Nature Cell Biology, vol. 5, no.
3. Springer Nature, pp. 231–235, 2003.
ista: Siekhaus DE, Drubin D. 2003. Spontaneous receptor-independent heterotrimeric
G-protein signalling in an RGS mutant. Nature Cell Biology. 5(3), 231–235.
mla: Siekhaus, Daria E., and David Drubin. “Spontaneous Receptor-Independent Heterotrimeric
G-Protein Signalling in an RGS Mutant.” Nature Cell Biology, vol. 5, no.
3, Springer Nature, 2003, pp. 231–35, doi:10.1038/ncb941.
short: D.E. Siekhaus, D. Drubin, Nature Cell Biology 5 (2003) 231–235.
date_created: 2018-12-11T12:01:41Z
date_published: 2003-03-01T00:00:00Z
date_updated: 2026-05-21T13:51:51Z
day: '01'
doi: 10.1038/ncb941
extern: '1'
external_id:
pmid:
- '12598904 '
fulldoi: https://doi.org/10.1038/ncb941
intvolume: ' 5'
issue: '3'
language:
- iso: eng
month: '03'
oa_version: None
page: 231 - 235
pmid: 1
publication: Nature Cell Biology
publication_identifier:
eissn:
- 1476-4679
issn:
- 1465-7392
publication_status: published
publisher: Springer Nature
publist_id: '3544'
quality_controlled: '1'
status: public
title: Spontaneous receptor-independent heterotrimeric G-protein signalling in an
RGS mutant
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 5
year: '2003'
...
---
OA_type: closed access
_id: '3151'
abstract:
- lang: eng
text: Biosynthesis of most peptide hormones and neuropeptides requires proteolytic
excision of the active peptide from inactive proprotein precursors, an activity
carried out by subtilisin-like proprotein convertases (SPCs) in constitutive or
regulated secretory pathways. The Drosophila amontillado (amon) gene encodes a
homolog of the mammalian PC2 protein, an SPC that functions in the regulated secretory
pathway in neuroendocrine tissues. We have identified amon mutants by isolating
ethylmethanesulfonate (EMS)-induced lethal and visible mutations that define two
complementation groups in the amon interval at 97D1 of the third chromosome. DNA
sequencing identified the amon complementation group and the DNA sequence change
for each of the nine amon alleles isolated. amon mutants display partial embryonic
lethality, are defective in larval growth, and arrest during the first to second
instar larval molt. Mutant larvae can be rescued by heat-shock-induced expression
of the amon protein. Rescued larvae arrest at the subsequent larval molt, suggesting
that amon is also required for the second to third instar larval molt. Our data
indicate that the amon proprotein convertase is required during embryogenesis
and larval development in Drosophila and support the hypothesis that AMON acts
to proteolytically process peptide hormones that regulate hatching, larval growth,
and larval ecdysis.
article_processing_charge: No
article_type: original
author:
- first_name: Lowell
full_name: Rayburn, Lowell
last_name: Rayburn
- first_name: Holly
full_name: Gooding, Holly
last_name: Gooding
- first_name: Semil
full_name: Choksi, Semil
last_name: Choksi
- first_name: Dhea
full_name: Maloney, Dhea
last_name: Maloney
- first_name: Ambrose
full_name: Kidd, Ambrose
last_name: Kidd
- first_name: Daria E
full_name: Siekhaus, Daria E
id: 3D224B9E-F248-11E8-B48F-1D18A9856A87
last_name: Siekhaus
orcid: 0000-0001-8323-8353
- first_name: Michael
full_name: Bender, Michael
last_name: Bender
citation:
ama: Rayburn L, Gooding H, Choksi S, et al. Amontillado, the Drosophila homolog
of the prohormone processing protease PC2, is required during embryogenesis and
early larval development. Genetics. 2003;163(1):227-237. doi:10.1093/genetics/163.1.227
apa: Rayburn, L., Gooding, H., Choksi, S., Maloney, D., Kidd, A., Siekhaus, D. E.,
& Bender, M. (2003). Amontillado, the Drosophila homolog of the prohormone
processing protease PC2, is required during embryogenesis and early larval development.
Genetics. Oxford Academic. https://doi.org/10.1093/genetics/163.1.227
chicago: Rayburn, Lowell, Holly Gooding, Semil Choksi, Dhea Maloney, Ambrose Kidd,
Daria E Siekhaus, and Michael Bender. “Amontillado, the Drosophila Homolog of
the Prohormone Processing Protease PC2, Is Required during Embryogenesis and Early
Larval Development.” Genetics. Oxford Academic, 2003. https://doi.org/10.1093/genetics/163.1.227.
ieee: L. Rayburn et al., “Amontillado, the Drosophila homolog of the prohormone
processing protease PC2, is required during embryogenesis and early larval development,”
Genetics, vol. 163, no. 1. Oxford Academic, pp. 227–237, 2003.
ista: Rayburn L, Gooding H, Choksi S, Maloney D, Kidd A, Siekhaus DE, Bender M.
2003. Amontillado, the Drosophila homolog of the prohormone processing protease
PC2, is required during embryogenesis and early larval development. Genetics.
163(1), 227–237.
mla: Rayburn, Lowell, et al. “Amontillado, the Drosophila Homolog of the Prohormone
Processing Protease PC2, Is Required during Embryogenesis and Early Larval Development.”
Genetics, vol. 163, no. 1, Oxford Academic, 2003, pp. 227–37, doi:10.1093/genetics/163.1.227.
short: L. Rayburn, H. Gooding, S. Choksi, D. Maloney, A. Kidd, D.E. Siekhaus, M.
Bender, Genetics 163 (2003) 227–237.
date_created: 2018-12-11T12:01:41Z
date_published: 2003-01-01T00:00:00Z
date_updated: 2026-05-22T08:38:04Z
day: '01'
doi: 10.1093/genetics/163.1.227
extern: '1'
external_id:
pmid:
- '12586710'
fulldoi: https://doi.org/10.1093/genetics/163.1.227
intvolume: ' 163'
issue: '1'
language:
- iso: eng
month: '01'
oa_version: None
page: 227 - 237
pmid: 1
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Oxford Academic
publist_id: '3545'
quality_controlled: '1'
status: public
title: Amontillado, the Drosophila homolog of the prohormone processing protease PC2,
is required during embryogenesis and early larval development
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 163
year: '2003'
...
---
OA_place: repository
OA_type: green
_id: '3171'
abstract:
- lang: eng
text: 'Reconstructing a 3-D scene from more than one camera is a classical problem
in computer vision. One of the major sources of difficulty is the fact that not
all scene elements are visible from all cameras. In the last few years, two promising
approaches have been developed 11,12 that formulate the scene reconstruction problem
in terms of energy minimization, and minimize the energy using graph cuts. These
energy minimization approaches treat the input images symmetrically, handle visibility
constraints correctly, and allow spatial smoothness to be enforced. However, these
algorithm propose different problem formulations, and handle a limited class of
smoothness terms. One algorithm 11 uses a problem formulation that is restricted
to two-camera stereo, and imposes smoothness between a pair of cameras. The other
algorithm 12 can handle an arbitrary number of cameras, but imposes smoothness
only with respect to a single camera. In this paper we give a more general energy
minimization formulation for the problem, which allows a larger class of spatial
smoothness constraints. We show that our formulation includes both of the previous
approaches as special cases, as well as permitting new energy functions. Experimental
results on real data with ground truth are also included. '
alternative_title:
- Energy Minimization Methods in Computer Vision and Pattern Recognition
article_processing_charge: No
author:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Ramin
full_name: Zabih, Ramin
last_name: Zabih
- first_name: Steven
full_name: Gortler, Steven
last_name: Gortler
citation:
ama: 'Kolmogorov V, Zabih R, Gortler S. Generalized multi camera scene reconstruction
using graph cuts. In: 4th International Workshop. Vol 2683. Springer Nature;
2003:501-516. doi:10.1007/978-3-540-45063-4_32'
apa: 'Kolmogorov, V., Zabih, R., & Gortler, S. (2003). Generalized multi camera
scene reconstruction using graph cuts. In 4th International Workshop (Vol.
2683, pp. 501–516). Lisbon, Portugal: Springer Nature. https://doi.org/10.1007/978-3-540-45063-4_32'
chicago: Kolmogorov, Vladimir, Ramin Zabih, and Steven Gortler. “Generalized Multi
Camera Scene Reconstruction Using Graph Cuts.” In 4th International Workshop,
2683:501–16. Springer Nature, 2003. https://doi.org/10.1007/978-3-540-45063-4_32.
ieee: V. Kolmogorov, R. Zabih, and S. Gortler, “Generalized multi camera scene reconstruction
using graph cuts,” in 4th International Workshop, Lisbon, Portugal, 2003,
vol. 2683, pp. 501–516.
ista: 'Kolmogorov V, Zabih R, Gortler S. 2003. Generalized multi camera scene reconstruction
using graph cuts. 4th International Workshop. EMMCVPR: Energy Minimization Methods
in Computer Vision and Pattern Recognition, Energy Minimization Methods in Computer
Vision and Pattern Recognition, vol. 2683, 501–516.'
mla: Kolmogorov, Vladimir, et al. “Generalized Multi Camera Scene Reconstruction
Using Graph Cuts.” 4th International Workshop, vol. 2683, Springer Nature,
2003, pp. 501–16, doi:10.1007/978-3-540-45063-4_32.
short: V. Kolmogorov, R. Zabih, S. Gortler, in:, 4th International Workshop, Springer
Nature, 2003, pp. 501–516.
conference:
end_date: 2003-07-09
location: Lisbon, Portugal
name: 'EMMCVPR: Energy Minimization Methods in Computer Vision and Pattern Recognition'
start_date: 2003-07-07
date_created: 2018-12-11T12:01:48Z
date_published: 2003-06-26T00:00:00Z
date_updated: 2026-05-21T13:04:17Z
day: '26'
doi: 10.1007/978-3-540-45063-4_32
extern: '1'
fulldoi: https://doi.org/10.1007/978-3-540-45063-4_32
intvolume: ' 2683'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.cs.cornell.edu/~rdz/Papers/KZG-EMMCVPR03.pdf
month: '06'
oa: 1
oa_version: Preprint
page: 501 - 516
publication: 4th International Workshop
publication_identifier:
eisbn:
- '9783540450634'
isbn:
- '9783540404989'
publication_status: published
publisher: Springer Nature
publist_id: '3512'
quality_controlled: '1'
status: public
title: Generalized multi camera scene reconstruction using graph cuts
type: conference
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 2683
year: '2003'
...
---
OA_place: publisher
OA_type: free access
_id: '3209'
abstract:
- lang: eng
text: We show that the fixed alphabet shortest common supersequence (SCS) and the
fixed alphabet longest common subsequence (LCS) problems parameterized in the
number of strings are W[1]-hard. Unless W[1]=FPT, this rules out the existence
of algorithms with time complexity of O(f(k)nα) for those problems. Here n is
the size of the problem instance, α is constant, k is the number of strings and
f is any function of k. The fixed alphabet version of the LCS problem is of particular
interest considering the importance of sequence comparison (e.g. multiple sequence
alignment) in the fixed length alphabet world of DNA and protein sequences.
article_processing_charge: No
article_type: original
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: Pietrzak KZ. On the parameterized complexity of the fixed alphabet shortest
common supersequence and longest common subsequence problems. Journal of Computer
and System Sciences. 2003;67(4):757-771. doi:10.1016/S0022-0000(03)00078-3
apa: Pietrzak, K. Z. (2003). On the parameterized complexity of the fixed alphabet
shortest common supersequence and longest common subsequence problems. Journal
of Computer and System Sciences. Elsevier. https://doi.org/10.1016/S0022-0000(03)00078-3
chicago: Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet
Shortest Common Supersequence and Longest Common Subsequence Problems.” Journal
of Computer and System Sciences. Elsevier, 2003. https://doi.org/10.1016/S0022-0000(03)00078-3.
ieee: K. Z. Pietrzak, “On the parameterized complexity of the fixed alphabet shortest
common supersequence and longest common subsequence problems,” Journal of Computer
and System Sciences, vol. 67, no. 4. Elsevier, pp. 757–771, 2003.
ista: Pietrzak KZ. 2003. On the parameterized complexity of the fixed alphabet shortest
common supersequence and longest common subsequence problems. Journal of Computer
and System Sciences. 67(4), 757–771.
mla: Pietrzak, Krzysztof Z. “On the Parameterized Complexity of the Fixed Alphabet
Shortest Common Supersequence and Longest Common Subsequence Problems.” Journal
of Computer and System Sciences, vol. 67, no. 4, Elsevier, 2003, pp. 757–71,
doi:10.1016/S0022-0000(03)00078-3.
short: K.Z. Pietrzak, Journal of Computer and System Sciences 67 (2003) 757–771.
date_created: 2018-12-11T12:02:01Z
date_published: 2003-12-01T00:00:00Z
date_updated: 2026-05-21T11:50:33Z
day: '01'
doi: 10.1016/S0022-0000(03)00078-3
extern: '1'
fulldoi: https://doi.org/10.1016/S0022-0000(03)00078-3
intvolume: ' 67'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/S0022-0000(03)00078-3
month: '12'
oa: 1
oa_version: Accepted Version
page: 757 - 771
publication: Journal of Computer and System Sciences
publication_status: published
publisher: Elsevier
publist_id: '3472'
quality_controlled: '1'
status: public
title: On the parameterized complexity of the fixed alphabet shortest common supersequence
and longest common subsequence problems
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 67
year: '2003'
...