Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Páidí Creed"'
Autor:
Jens Füllgrabe, Walraj S. Gosal, Páidí Creed, Sidong Liu, Casper K. Lumby, David J. Morley, Tobias W. B. Ost, Albert J. Vilella, Shirong Yu, Helen Bignell, Philippa Burns, Tom Charlesworth, Beiyuan Fu, Howerd Fordham, Nicolas J. Harding, Olga Gandelman, Paula Golder, Christopher Hodson, Mengjie Li, Marjana Lila, Yang Liu, Joanne Mason, Jason Mellad, Jack M. Monahan, Oliver Nentwich, Alexandra Palmer, Michael Steward, Minna Taipale, Audrey Vandomme, Rita Santo San-Bento, Ankita Singhal, Julia Vivian, Natalia Wójtowicz, Nathan Williams, Nicolas J. Walker, Nicola C. H. Wong, Gary N. Yalloway, Joanna D. Holbrook, Shankar Balasubramanian
Publikováno v:
Nature Biotechnology.
DNA comprises molecular information stored in genetic and epigenetic bases, both of which are vital to our understanding of biology. Most DNA sequencing approaches address either genetics or epigenetics and thus capture incomplete information. Method
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9d8005a9ad5fe3c2a23faf8b6338fb23
https://doi.org/10.1038/s41587-022-01652-0
https://doi.org/10.1038/s41587-022-01652-0
Autor:
Jens Füllgrabe, Walraj S Gosal, Páidí Creed, Sidong Liu, Casper K Lumby, David J Morley, Tobias W B Ost, Albert J Vilella, Shirong Yu, Helen Bignell, Philippa Burns, Tom Charlesworth, Beiyuan Fu, Howerd Fordham, Nick Harding, Olga Gandelman, Paula Golder, Christopher Hodson, Mengjie Li, Marjana Lila, Yang Liu, Joanne Mason, Jason Mellad, Jack Monahan, Oliver Nentwich, Alexandra Palmer, Michael Steward, Minna Taipale, Audrey Vandomme, Rita Santo San-Bento, Ankita Singhal, Julia Vivian, Natalia Wójtowicz, Nathan Williams, Nicolas J Walker, Nicola C H Wong, Gary Yalloway, Joanna D Holbrook, Shankar Balasubaramanian
DNA comprises molecular information stored via genetic bases (G, C, T, A) and also epigenetic bases, principally 5-methylcytosine (5mC) and 5-hydroxymethylcytosine (5hmC). Both genetic and epigenetic information are vital to our understanding of biol
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac2af7acf13559572475f1c21b6cbf27
https://doi.org/10.1101/2022.07.08.499285
https://doi.org/10.1101/2022.07.08.499285
Publikováno v:
SIAM Journal on Computing
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2013, vol. 42 (n° 5), pp. 1915-1939. ⟨10.1137/130906398⟩
SIAM Journal on Computing, Society for Industrial and Applied Mathematics, 2013, vol. 42 (n° 5), pp. 1915-1939. ⟨10.1137/130906398⟩
Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a unifying theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1398cccc8ba2dae74075be71156efe8d
https://doi.org/10.1137/130906398
https://doi.org/10.1137/130906398
Publikováno v:
IFAC Proceedings Volumes. 39:113-117
Temperature cycling test is one of the key stages in the process of testing circuit packs in telecommunications. To obtain a good overall test schedule requires that the thermal test is carried out efficiently i.e. with the minimum number of runs and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d42e6512b9ffb2644b80fb4168dcce4d
https://doi.org/10.3182/20060517-3-fr-2903.00068
https://doi.org/10.3182/20060517-3-fr-2903.00068
Autor:
Mary Cryan, Páidí Creed
Publikováno v:
The Electronic Journal of Combinatorics. 20
In this paper we obtain the expectation and variance of the number of Euler tours of a random Eulerian directed graph with fixed out-degree sequence. We use this to obtain the asymptotic distribution of the number of Euler tours of a random $d$-in/$d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1510ed9b83794d85ccf1ea24845b2570
https://doi.org/10.37236/2377
https://doi.org/10.37236/2377
Autor:
Páidí Creed, Stanislav Živny
Publikováno v:
Principles and Practice of Constraint Programming – CP 2011 ISBN: 9783642237850
CP
CP
The connection between the complexity of constraint languages and clone theory, discovered by Cohen and Jeavons in a series of papers, has been a fruitful line of research on the complexity of CSPs. In a recent result, Cohen et al. [14] have establis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b77b7b3fa711f1340cb1cf169cbede9c
https://doi.org/10.1007/978-3-642-23786-7_18
https://doi.org/10.1007/978-3-642-23786-7_18
Publikováno v:
Mathematical Foundations of Computer Science 2011 ISBN: 9783642229923
MFCS
MFCS
The complexity of any optimisation problem depends critically on the form of the objective function. Valued constraint satisfaction problems are discrete optimisation problems where the function to be minimised is given as a sum of cost functions def
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06fae12bde33f997c18caaa2c5ba6077
http://ora.ox.ac.uk/objects/uuid:57be31dc-393e-417d-a2f2-a6102a87a2f2
http://ora.ox.ac.uk/objects/uuid:57be31dc-393e-417d-a2f2-a6102a87a2f2
Autor:
Mary Cryan, Páidí Creed
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.117-128
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10)
21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.117-128
In this paper we obtain the expectation and variance of the number of Euler tours of a random $d$-in/$d$-out directed graph, for $d \geq 2$. We use this to obtain the asymptotic distribution and prove a concentration result. We are then able to show
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20a5bfd401c2ffe6465046519706f6fd
https://dmtcs.episciences.org/2787
https://dmtcs.episciences.org/2787
Autor:
Páidí Creed
Publikováno v:
Journal of Discrete Algorithms. (2):168-180
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm studied here
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bb0a32bc8992ae04034d2117e02dff3f
Autor:
Füllgrabe, Jens, Gosal, Walraj S., Creed, Páidí, Liu, Sidong, Lumby, Casper K., Morley, David J., Ost, Tobias W. B., Vilella, Albert J., Yu, Shirong, Bignell, Helen, Burns, Philippa, Charlesworth, Tom, Fu, Beiyuan, Fordham, Howerd, Harding, Nicolas J., Gandelman, Olga, Golder, Paula, Hodson, Christopher, Li, Mengjie, Lila, Marjana
Publikováno v:
Nature Biotechnology; Oct2023, Vol. 41 Issue 10, p1457-1464, 8p