Published in: OASIcs, Volume 26, German Conference on Bioinformatics 2012
Richard Röttger, Christoph Kreutzer, Thuy Duong Vu, Tobias Wittkop, and Jan Baumbach. Online Transitivity Clustering of Biological Data with Missing Values. In German Conference on Bioinformatics 2012. Open Access Series in Informatics (OASIcs), Volume 26, pp. 57-68, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{rottger_et_al:OASIcs.GCB.2012.57, author = {R\"{o}ttger, Richard and Kreutzer, Christoph and Vu, Thuy Duong and Wittkop, Tobias and Baumbach, Jan}, title = {{Online Transitivity Clustering of Biological Data with Missing Values}}, booktitle = {German Conference on Bioinformatics 2012}, pages = {57--68}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-44-6}, ISSN = {2190-6807}, year = {2012}, volume = {26}, editor = {B\"{o}cker, Sebastian and Hufsky, Franziska and Scheubert, Kerstin and Schleicher, Jana and Schuster, Stefan}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.GCB.2012.57}, URN = {urn:nbn:de:0030-drops-37189}, doi = {10.4230/OASIcs.GCB.2012.57}, annote = {Keywords: Transitivity Clustering, Large Scale clustering, Missing Values, Web Interface} }
Published in: LIPIcs, Volume 14, 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)
Robert Ganian, Petr Hlineny, Alexander Langer, Jan Obdržálek, Peter Rossmanith, and Somnath Sikdar. Lower Bounds on the Complexity of MSO_1 Model-Checking. In 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 14, pp. 326-337, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{ganian_et_al:LIPIcs.STACS.2012.326, author = {Ganian, Robert and Hlineny, Petr and Langer, Alexander and Obdr\v{z}\'{a}lek, Jan and Rossmanith, Peter and Sikdar, Somnath}, title = {{Lower Bounds on the Complexity of MSO\underline1 Model-Checking}}, booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)}, pages = {326--337}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-35-4}, ISSN = {1868-8969}, year = {2012}, volume = {14}, editor = {D\"{u}rr, Christoph and Wilke, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.326}, URN = {urn:nbn:de:0030-drops-34185}, doi = {10.4230/LIPIcs.STACS.2012.326}, annote = {Keywords: Monadic Second-Order Logic, Treewidth, Lower Bounds, Exponential Time Hypothesis, Parameterized Complexity} }
Feedback for Dagstuhl Publishing