Markus Nebel
PEVZ-ID
54 Publikationen
-
2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2956771Müller, R. & Nebel, M. (2021). On the use of sequence-quality information in OTU clustering. PeerJ, 9: e11717. PeerJ. doi:10.7717/peerj.11717.
-
2021 | Datenpublikation | PUB-ID: 2951742Müller, R. & Nebel, M. (2021). Evaluation data for "On the use of sequence-quality information in OTU clustering". Bielefeld University. doi:10.4119/unibi/2951742.
-
2018 | Datenpublikation | PUB-ID: 2918928Müller, R. & Nebel, M. (2018). Evaluation data for "GeFaST: An improved method for OTU assignment by generalising Swarm's fastidious clustering approach". Bielefeld University. doi:10.4119/unibi/2918928.
-
2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2931048Müller, R. & Nebel, M. (2018). GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach. BMC Bioinformatics, 19(1): 321. BioMed Central. doi:10.1186/s12859-018-2349-1.
-
-
-
-
-
2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909993Nebel, M., Wild, S. & Martinez, C. (2016). Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Algorithmica, 75(4), 632-683. Springer US. doi:10.1007/s00453-015-0041-7.
-
2015 | Zeitschriftenaufsatz | PUB-ID: 2909997Müller, R. & Nebel, M. (2015). Combinatorics of RNA Secondary Structures with Base Triples. Journal of Computational Biology, 22(7), 619--648. Mary Ann Liebert Inc. doi:10.1089/cmb.2013.0022.
-
2015 | Konferenzbeitrag | PUB-ID: 2909999Martinez, C., Nebel, M. & Wild, S. (2015). Analysis of Branch Misses in Quicksort. Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015 (S. 114--128). Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611973761.11.
-
2015 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2910050Codish, M., Cruz-Filipe, L., Nebel, M. & Schneider-Kamp, P. (2015). Applying Sorting Networks to Synthesize Optimized Sorting Libraries (Lecture Notes in Computer Science). In M. Falaschi (Hrsg.), Logic-Based Program Synthesis and Transformation - 25th International Symposium, LOPSTR 2015, Siena, Italy, July 13-15, 2015. Revised Selected Papers (S. 127-142). Gehalten auf der 25th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2015, held in y, in July 2015, Berlin ; Heidelberg: Springer. doi:10.1007/978-3-319-27436-2_8.
-
-
2014 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2910000Nebel, M. & Wild, S. (2014). Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme (DMTCS-HAL Proceedings Series). In M. Bousquet-Mélou & M. Soria (Hrsg.), Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (S. 325-338). Gehalten auf der 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2014).
-
-
2013 | Konferenzband | PUB-ID: 2910004Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013. (2013). Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013. (M. Nebel & W. Szpankowski, Hrsg.). SIAM. doi:10.1137/1.9781611973037.
-
-
2013 | Konferenzbeitrag | PUB-ID: 2910003Wild, S., Nebel, M., Reitzig, R. & Laube, U. (2013). Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013 (S. 55--69). Philadelphia, PA: Society for Industrial and Applied Mathematics. doi:10.1137/1.9781611972931.5.
-
2012 | Zeitschriftenaufsatz | PUB-ID: 2910010Scheid, A. & Nebel, M. (2012). Evaluating the Effect of Disturbed Ensemble Distributions on SCFG Based Statistical Sampling of RNA Secondary Structures. BMC Bioinformatics, 13(1): 159. Springer Science and Business Media LLC. doi:10.1186/1471-2105-13-159.
-
2012 | Zeitschriftenaufsatz | PUB-ID: 2910009M. Reidys, C., W. D. Huang, F., E. Andersen, J., C. Penner, R., F. Stadler, P. & Nebel, M. (2012). Addendum: topology and prediction of RNA pseudoknots. Bioinformatics, 28(2), 300. Oxford University Press (OUP). doi:10.1093/bioinformatics/btr643.
-
2012 | Zeitschriftenaufsatz | PUB-ID: 2910012Nebel, M. & Weinberg, F. (2012). Algebraic and Combinatorial Properties of Common RNA Pseudoknot Classes with Applications. Journal of Computational Biology, 19(10), 1134--1150. Mary Ann Liebert Inc. doi:10.1089/cmb.2011.0094.
-
2012 | Konferenzbeitrag | PUB-ID: 2910014Nebel, M. & Scheid, A. (2012). A n^2 RNA Secondary Structure Prediction Algorithm. BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1 - 4 February, 2012. (S. 66--75).
-
2012 | Zeitschriftenaufsatz | PUB-ID: 2910011Yu Jin, E. & Nebel, M. (2012). A Combinatorial Proof of the Recurrence for Rook Paths. Electr. J. Comb., 19(1), P57.
-
2012 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2910013Yu Jin, E. & Nebel, M. (2012). The Expected Order of Saturated RNA Secondary Structures. In H.-K. Hwang & C. Martínez (Hrsg.), 2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (S. 84-91). Gehalten auf der 9th Workshop on Analytic Algorithmics and Combinatorics (ANALCO), SIAM. doi:10.1137/1.9781611973020.11.
-
2012 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2910015Wild, S. & Nebel, M. (2012). Average Case Analysis of Java 7's Dual Pivot Quicksort (Lecture Notes in Computer Science). In L. Epstein & P. Ferragina (Hrsg.), Algorithms - ESA 2012. 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings (S. 825-836). Gehalten auf der Algorithms – ESA 2012 20th Annual European Symposium, Berlin ; Heidelberg: Springer. doi:10.1007/978-3-642-33090-2_71.
-
-
2011 | Zeitschriftenaufsatz | PUB-ID: 2910017Nebel, M., Scheid, A. & Weinberg, F. (2011). Random generation of RNA secondary structures according to native distributions. Algorithms for Molecular Biology, 6(1): 24. Springer Science and Business Media LLC. doi:10.1186/1748-7188-6-24.
-
2011 | Zeitschriftenaufsatz | PUB-ID: 2910021Nebel, M. & Scheid, A. (2011). Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model. IEEE/ACM Trans. Comput. Biology Bioinform., 8(6), 1468--1482. Institute of Electrical and Electronics Engineers (IEEE). doi:10.1109/TCBB.2010.126.
-
2011 | Zeitschriftenaufsatz | PUB-ID: 2910022Nebel, M. & Scheid, A. (2011). Evaluation of a sophisticated SCFG design for RNA secondary structure prediction. Theory in Biosciences, 130(4), 313--336. Springer Science and Business Media LLC. doi:10.1007/s12064-011-0139-7.
-
2011 | Zeitschriftenaufsatz | PUB-ID: 2910018M. Reidys, C., W. D. Huang, F., E. Andersen, J., C. Penner, R., F. Stadler, P. & Nebel, M. (2011). Topology and prediction of RNA pseudoknots. Bioinformatics, 27(8), 1076--1085. Oxford University Press (OUP). doi:10.1093/bioinformatics/btr090.
-
2011 | Zeitschriftenaufsatz | PUB-ID: 2910019Nebel, M., Wild, S., Holzhauser, M., Hüttenberger, L., Reitzig, R., Sperber, M. & Stoeck, T. (2011). Jaguc - a Software package for Environmental Diversity Analyses. J. Bioinformatics and Computational Biology, 9(6), 749--773. World Scientific Pub Co Pte Lt. doi:10.1142/S0219720011005781.
-
2011 | Zeitschriftenaufsatz | PUB-ID: 2910020Nebel, M., M. Reidys, C. & R. Wang, R. (2011). Loops in Canonical RNA Pseudoknot Structures. Journal of Computational Biology, 18(12), 1793--1806. Mary Ann Liebert Inc. doi:10.1089/cmb.2010.0022.
-
2011 | Konferenzbeitrag | PUB-ID: 2910023Afzal Uzmi, Z., Nebel, M., Tariq, A., Jawad, S., Chen, R., Shaikh, A., Wang, J. & Francis, P. (2011). SMALTA: practical and near-optimal FIB aggregation (ACM Digital Library). In Association for Computing Machinery (Hrsg.), Proceedings of the 2011 Conference on Emerging Networking Experiments and Technologies, Co-NEXT '11, Tokyo, Japan, December 6-9, 2011 (S. 29). New York, NY: ACM Press. doi:10.1145/2079296.2079325.
-
-
-
-
2010 | Konferenzbeitrag | PUB-ID: 2910027Weinberg, F. & Nebel, M. (2010). Extending Stochastic Context-Free Grammars for an Application in Bioinformatics. Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings (S. 585--595). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-13089-2_49.
-
2009 | Zeitschriftenaufsatz | PUB-ID: 2910028Nebel, M. & Scheid, A. (2009). On quantitative effects of RNA shape abstraction. Theory in Biosciences, 128(4), 211--225. Springer Science and Business Media LLC. doi:10.1007/s12064-009-0074-z.
-
-
2007 | Konferenzbeitrag | PUB-ID: 2910032Nebel, M. (2007). Compact Descriptions for Efficient Algorithms. 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007 (S. 27--40).
-
-
-
-
2004 | Konferenzbeitrag | PUB-ID: 2910036Nebel, M. (2004). Identifying Good Predictions of RNA Secondary Structure. Biocomputing 2004, Proceedings of the Pacific Symposium, Hawaii, USA, 6-10 January 2004 (S. 423--434).
-
2003 | Zeitschriftenaufsatz | PUB-ID: 2910037Nebel, M. (2003). Combinatorial Properties of RNA Secondary Structures. Journal of Computational Biology, 9(3), 541--573. Mary Ann Liebert Inc. doi:10.1089/106652702760138628.
-
2002 | Zeitschriftenaufsatz | PUB-ID: 2910038Nebel, M. (2002). The Stack-Size of Combinatorial Tries Revisited. Discrete Mathematics & Theoretical Computer Science, 5(1), 1--16.
-
-
-
2001 | Zeitschriftenaufsatz | PUB-ID: 2910042Nebel, M. (2001). On the Power of Subroutines for Finite State Machines. Journal of Automata, Languages and Combinatorics, 6(1), 51--74.
-
-
-
1997 | Zeitschriftenaufsatz | PUB-ID: 2910045Nebel, M. (1997). New Results on the Stack Ramification of Binary Trees. Journal of Automata, Languages and Combinatorics, 2(3), 161--176.
-
1997 | Konferenzbeitrag | PUB-ID: 2910046Nebel, M. (1997). On the Average Complexity of the Membership Problem for a Generalized Dyck Language. Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings (S. 352--363). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/BFb0036197.
-
1996 | Zeitschriftenaufsatz | PUB-ID: 2910047Nebel, M. (1996). Digital Search Trees with Keys of Variable Length. ITA, 30(6), 507--520. EDP Sciences.