Published in: LIPIcs, Volume 201, 21st International Workshop on Algorithms in Bioinformatics (WABI 2021)
Anuradha Wickramarachchi and Yu Lin. LRBinner: Binning Long Reads in Metagenomics Datasets. In 21st International Workshop on Algorithms in Bioinformatics (WABI 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 201, pp. 11:1-11:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{wickramarachchi_et_al:LIPIcs.WABI.2021.11, author = {Wickramarachchi, Anuradha and Lin, Yu}, title = {{LRBinner: Binning Long Reads in Metagenomics Datasets}}, booktitle = {21st International Workshop on Algorithms in Bioinformatics (WABI 2021)}, pages = {11:1--11:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-200-6}, ISSN = {1868-8969}, year = {2021}, volume = {201}, editor = {Carbone, Alessandra and El-Kebir, Mohammed}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2021.11}, URN = {urn:nbn:de:0030-drops-143644}, doi = {10.4230/LIPIcs.WABI.2021.11}, annote = {Keywords: Metagenomics binning, long reads, machine learning, clustering} }
Published in: LIPIcs, Volume 172, 20th International Workshop on Algorithms in Bioinformatics (WABI 2020)
Vijini G. Mallawaarachchi, Anuradha S. Wickramarachchi, and Yu Lin. GraphBin2: Refined and Overlapped Binning of Metagenomic Contigs Using Assembly Graphs. In 20th International Workshop on Algorithms in Bioinformatics (WABI 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 172, pp. 8:1-8:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{mallawaarachchi_et_al:LIPIcs.WABI.2020.8, author = {Mallawaarachchi, Vijini G. and Wickramarachchi, Anuradha S. and Lin, Yu}, title = {{GraphBin2: Refined and Overlapped Binning of Metagenomic Contigs Using Assembly Graphs}}, booktitle = {20th International Workshop on Algorithms in Bioinformatics (WABI 2020)}, pages = {8:1--8:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-161-0}, ISSN = {1868-8969}, year = {2020}, volume = {172}, editor = {Kingsford, Carl and Pisanti, Nadia}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2020.8}, URN = {urn:nbn:de:0030-drops-127974}, doi = {10.4230/LIPIcs.WABI.2020.8}, annote = {Keywords: Metagenomics binning, contigs, assembly graphs, overlapped binning} }
Published in: Dagstuhl Seminar Proceedings, Volume 5142, Disruption Tolerant Networking (2005)
Aaditeshwar Seth, Patrick Darragh, Suihong Liang, Yunfeng Lin, and Srinivasan Keshav. An Architecture for Tetherless Communication. In Disruption Tolerant Networking. Dagstuhl Seminar Proceedings, Volume 5142, pp. 1-13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{seth_et_al:DagSemProc.05142.3, author = {Seth, Aaditeshwar and Darragh, Patrick and Liang, Suihong and Lin, Yunfeng and Keshav, Srinivasan}, title = {{An Architecture for Tetherless Communication}}, booktitle = {Disruption Tolerant Networking}, pages = {1--13}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {5142}, editor = {Marcus Brunner and Lars Eggert and Kevin Fall and J\"{o}rg Ott and Lars Wolf}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05142.3}, URN = {urn:nbn:de:0030-drops-3519}, doi = {10.4230/DagSemProc.05142.3}, annote = {Keywords: Delay tolerant networks, Opportunistic communication, Tetherless computing, Wireless, Mobile} }
Published in: LIPIcs, Volume 132, 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu. Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning. In 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 132, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{brandao_et_al:LIPIcs.ICALP.2019.27, author = {Brand\~{a}o, Fernando G. S. L. and Kalev, Amir and Li, Tongyang and Lin, Cedric Yen-Yu and Svore, Krysta M. and Wu, Xiaodi}, title = {{Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning}}, booktitle = {46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-109-2}, ISSN = {1868-8969}, year = {2019}, volume = {132}, editor = {Baier, Christel and Chatzigiannakis, Ioannis and Flocchini, Paola and Leonardi, Stefano}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2019.27}, URN = {urn:nbn:de:0030-drops-106036}, doi = {10.4230/LIPIcs.ICALP.2019.27}, annote = {Keywords: quantum algorithms, semidefinite program, convex optimization} }
Published in: LIPIcs, Volume 94, 9th Innovations in Theoretical Computer Science Conference (ITCS 2018)
Bill Fefferman and Cedric Yen-Yu Lin. A Complete Characterization of Unitary Quantum Space. In 9th Innovations in Theoretical Computer Science Conference (ITCS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 94, pp. 4:1-4:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fefferman_et_al:LIPIcs.ITCS.2018.4, author = {Fefferman, Bill and Lin, Cedric Yen-Yu}, title = {{A Complete Characterization of Unitary Quantum Space}}, booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)}, pages = {4:1--4:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-060-6}, ISSN = {1868-8969}, year = {2018}, volume = {94}, editor = {Karlin, Anna R.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.4}, URN = {urn:nbn:de:0030-drops-83242}, doi = {10.4230/LIPIcs.ITCS.2018.4}, annote = {Keywords: Quantum complexity, space complexity, complete problems, QMA} }
Published in: LIPIcs, Volume 44, 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)
Shelby Kimmel, Cedric Yen-Yu Lin, and Han-Hsuan Lin. Oracles with Costs. In 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 44, pp. 1-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{kimmel_et_al:LIPIcs.TQC.2015.1, author = {Kimmel, Shelby and Lin, Cedric Yen-Yu and Lin, Han-Hsuan}, title = {{Oracles with Costs}}, booktitle = {10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015)}, pages = {1--26}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-96-5}, ISSN = {1868-8969}, year = {2015}, volume = {44}, editor = {Beigi, Salman and K\"{o}nig, Robert}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2015.1}, URN = {urn:nbn:de:0030-drops-55459}, doi = {10.4230/LIPIcs.TQC.2015.1}, annote = {Keywords: Quantum Algorithms, Query Complexity, Amplitude Amplification} }
Published in: LIPIcs, Volume 33, 30th Conference on Computational Complexity (CCC 2015)
Cedric Yen-Yu Lin and Han-Hsuan Lin. Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester. In 30th Conference on Computational Complexity (CCC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 33, pp. 537-566, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{lin_et_al:LIPIcs.CCC.2015.537, author = {Lin, Cedric Yen-Yu and Lin, Han-Hsuan}, title = {{Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester}}, booktitle = {30th Conference on Computational Complexity (CCC 2015)}, pages = {537--566}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-81-1}, ISSN = {1868-8969}, year = {2015}, volume = {33}, editor = {Zuckerman, David}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2015.537}, URN = {urn:nbn:de:0030-drops-50635}, doi = {10.4230/LIPIcs.CCC.2015.537}, annote = {Keywords: Quantum Algorithms, Query Complexity, Elitzur-Vaidman Bomb Tester, Adversary Method, Maximum Bipartite Matching} }
Published in: LIPIcs, Volume 80, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Chengyu Lin and Shengyu Zhang. Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers. In 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 80, pp. 51:1-51:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{lin_et_al:LIPIcs.ICALP.2017.51, author = {Lin, Chengyu and Zhang, Shengyu}, title = {{Sensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers}}, booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)}, pages = {51:1--51:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-041-5}, ISSN = {1868-8969}, year = {2017}, volume = {80}, editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.51}, URN = {urn:nbn:de:0030-drops-74045}, doi = {10.4230/LIPIcs.ICALP.2017.51}, annote = {Keywords: Analysis of Boolean functions, Sensitivity Conjecture, Log-rank Conjecture, Alternating Number} }
Published in: LIPIcs, Volume 167, 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)
Yu-Yang Lin and Nikos Tzevelekos. Symbolic Execution Game Semantics. In 5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 167, pp. 27:1-27:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{lin_et_al:LIPIcs.FSCD.2020.27, author = {Lin, Yu-Yang and Tzevelekos, Nikos}, title = {{Symbolic Execution Game Semantics}}, booktitle = {5th International Conference on Formal Structures for Computation and Deduction (FSCD 2020)}, pages = {27:1--27:24}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-155-9}, ISSN = {1868-8969}, year = {2020}, volume = {167}, editor = {Ariola, Zena M.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2020.27}, URN = {urn:nbn:de:0030-drops-123493}, doi = {10.4230/LIPIcs.FSCD.2020.27}, annote = {Keywords: game semantics, symbolic execution, higher-order open programs} }
Published in: LIPIcs, Volume 172, 20th International Workshop on Algorithms in Bioinformatics (WABI 2020)
Xilin Yu, Thien Le, Sarah Christensen, Erin K. Molloy, and Tandy Warnow. Advancing Divide-And-Conquer Phylogeny Estimation Using Robinson-Foulds Supertrees. In 20th International Workshop on Algorithms in Bioinformatics (WABI 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 172, pp. 15:1-15:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{yu_et_al:LIPIcs.WABI.2020.15, author = {Yu, Xilin and Le, Thien and Christensen, Sarah and Molloy, Erin K. and Warnow, Tandy}, title = {{Advancing Divide-And-Conquer Phylogeny Estimation Using Robinson-Foulds Supertrees}}, booktitle = {20th International Workshop on Algorithms in Bioinformatics (WABI 2020)}, pages = {15:1--15:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-161-0}, ISSN = {1868-8969}, year = {2020}, volume = {172}, editor = {Kingsford, Carl and Pisanti, Nadia}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.WABI.2020.15}, URN = {urn:nbn:de:0030-drops-128048}, doi = {10.4230/LIPIcs.WABI.2020.15}, annote = {Keywords: supertrees, divide-and-conquer, phylogeny estimation} }