Zobrazeno 1 - 10
of 2 176
pro vyhledávání: '"Stougie, L."'
Autor:
Bernardini G; University of Trieste, Trieste, Italy. Electronic address: giulia.bernardini@units.it., van Iersel L; Delft Institute of Applied Mathematics, Delft, The Netherlands., Julien E; Delft Institute of Applied Mathematics, Delft, The Netherlands. Electronic address: E.A.T.Julien@tudelft.nl., Stougie L; CWI, Amsterdam, the Netherlands; Vrije Universiteit, Amsterdam, The Netherlands; INRIA-Erable, France.
Publikováno v:
Molecular phylogenetics and evolution [Mol Phylogenet Evol] 2024 Oct; Vol. 199, pp. 108137. Date of Electronic Publication: 2024 Jul 17.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Bernardini G; University of Trieste, Trieste, Italy., van Iersel L; Delft Institute of Applied Mathematics, Delft, The Netherlands., Julien E; Delft Institute of Applied Mathematics, Delft, The Netherlands., Stougie L; CWI, Amsterdam, The Netherlands. leen.stougie@cwi.nl.; Vrije Universiteit, Amsterdam, The Netherlands. leen.stougie@cwi.nl.; INRIA-ERABLE, Lyon, France. leen.stougie@cwi.nl.
Publikováno v:
Algorithms for molecular biology : AMB [Algorithms Mol Biol] 2023 Sep 16; Vol. 18 (1), pp. 13. Date of Electronic Publication: 2023 Sep 16.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
De Bontridder, K.M.J., Halldórsson, B.V., Halldórsson, M.M., Hurkens, C.A.J., Lenstra, J.K., Ravi, R., Stougie, L.
Publikováno v:
In Operations Research Letters January 2021 49(1):62-68
There is a well-known connection between hypergraphs and bipartite graphs, obtained by treating the incidence matrix of the hypergraph as the biadjacency matrix of a bipartite graph. We use this connection to describe and analyse a rejection sampling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1874::53747718daa42ac9a395b4ec30ade948
https://hdl.handle.net/21.11116/0000-0007-9152-821.11116/0000-0007-9154-6
https://hdl.handle.net/21.11116/0000-0007-9152-821.11116/0000-0007-9154-6
Autor:
Olver N; Department of Mathematics, London School of Economics and Political Science, London, United Kingdom.; Centrum Wiskunde & Informatica, Amsterdam, Netherlands., Schalekamp F; School of Operations Research and Information Engineering, Cornell University, Ithaca, USA., van der Ster S; Albert Heijn Online, Zaandam, Netherlands., Stougie L; Centrum Wiskunde & Informatica, Amsterdam, Netherlands.; Department of Operations Analytics, Vrije Universiteit Amsterdam, Amsterdam, Netherlands.; INRIA-Erable, Lyon, France., van Zuylen A; Department of Computer Science, Cornell University, Ithaca, USA.
Publikováno v:
Mathematical programming [Math Program] 2023; Vol. 198 (1), pp. 811-853. Date of Electronic Publication: 2022 Mar 21.
Publikováno v:
In Journal of Combinatorial Theory, Series B 2006 96(1):159-163
Autor:
Patterson, M.D., Marschall, T., Pisanti, N., van Iersel, L.J.J., Stougie, L., Klau, G.W., Schönhuth, A.
Publikováno v:
Journal of Computational Biology, 22(6), 498-509. Mary Ann Liebert Inc.
Patterson, M D, Marschall, T, Pisanti, N, van Iersel, L J J, Stougie, L, Klau, G W & Schönhuth, A 2015, ' Weighted haplotype assembly for future-generation sequencing reads ', Journal of Computational Biology, vol. 22, no. 6, pp. 498-509 . https://doi.org/10.1089/cmb.2014.0157
Patterson, M D, Marschall, T, Pisanti, N, van Iersel, L J J, Stougie, L, Klau, G W & Schönhuth, A 2015, ' Weighted haplotype assembly for future-generation sequencing reads ', Journal of Computational Biology, vol. 22, no. 6, pp. 498-509 . https://doi.org/10.1089/cmb.2014.0157
The human genome is diploid, which requires assigning heterozygous single nucleotide polymorphisms (SNPs) to the two copies of the genome. The resulting haplotypes, lists of SNPs belonging to each copy, are crucial for downstream analyses in populati
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f545a5d7979a379b10c43a83c9a5e32b
https://hdl.handle.net/1871.1/35a47b66-0d62-4cda-8b50-5d10b03f1538
https://hdl.handle.net/1871.1/35a47b66-0d62-4cda-8b50-5d10b03f1538
Publikováno v:
Algorithmic Aspects of Wireless Sensor Networks (4th International Workshop, Algosensors 2008, Reykjavik, Iceland, July 12, 2008, Revised Selected Papers), 18-29
STARTPAGE=18;ENDPAGE=29;TITLE=Algorithmic Aspects of Wireless Sensor Networks (4th International Workshop, Algosensors 2008, Reykjavik, Iceland, July 12, 2008, Revised Selected Papers)
Bonifaci, V, Korteweg, P, Marchetti Spaccamela, A & Stougie, L 2008, Minimizing average flow time in sensor data gathering . in Proceedings of the 4th International Workshop on Algorithms for Sensor Networks (Algosensor) Bioinformatics, Lecture Notes in Computer Science . Springer Verlag, Berlin, pp. 18-29, 4th International Conference on Algorithms for Sensor Networks, 1/07/08 .
Proceedings of the 4th International Workshop on Algorithms for Sensor Networks (Algosensor) Bioinformatics, Lecture Notes in Computer Science, 18-29
STARTPAGE=18;ENDPAGE=29;TITLE=Proceedings of the 4th International Workshop on Algorithms for Sensor Networks (Algosensor) Bioinformatics, Lecture Notes in Computer Science
Algorithmic Aspects of Wireless Sensor Networks ISBN: 9783540928614
ALGOSENSORS
STARTPAGE=18;ENDPAGE=29;TITLE=Algorithmic Aspects of Wireless Sensor Networks (4th International Workshop, Algosensors 2008, Reykjavik, Iceland, July 12, 2008, Revised Selected Papers)
Bonifaci, V, Korteweg, P, Marchetti Spaccamela, A & Stougie, L 2008, Minimizing average flow time in sensor data gathering . in Proceedings of the 4th International Workshop on Algorithms for Sensor Networks (Algosensor) Bioinformatics, Lecture Notes in Computer Science . Springer Verlag, Berlin, pp. 18-29, 4th International Conference on Algorithms for Sensor Networks, 1/07/08 .
Proceedings of the 4th International Workshop on Algorithms for Sensor Networks (Algosensor) Bioinformatics, Lecture Notes in Computer Science, 18-29
STARTPAGE=18;ENDPAGE=29;TITLE=Proceedings of the 4th International Workshop on Algorithms for Sensor Networks (Algosensor) Bioinformatics, Lecture Notes in Computer Science
Algorithmic Aspects of Wireless Sensor Networks ISBN: 9783540928614
ALGOSENSORS
Building on previous work [Bonifaci et al., Minimizing flow time in the wireless gathering problem, STACS 2008] we study data gathering in a wireless network through multi-hop communication with the objective to minimize the average flow time of a da
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d3df11855d0a36818b290625b5341275
https://doi.org/10.1007/978-3-540-92862-1_3
https://doi.org/10.1007/978-3-540-92862-1_3