PUB - Publikationen an der Universität Bielefeld

Alle markieren

• [54]
  

  2021 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2956771

  Müller, R., & Nebel, M., 2021. On the use of sequence-quality information in OTU clustering. PeerJ, 9: e11717.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [53]
  

  2021 | Datenpublikation | PUB-ID: 2951742

  Müller, R., & Nebel, M., 2021. Evaluation data for "On the use of sequence-quality information in OTU clustering", Bielefeld University.

  PUB | Dateien verfügbar | DOI
   
• [52]
  

  2018 | Datenpublikation | PUB-ID: 2918928

  Müller, R., & Nebel, M., 2018. Evaluation data for "GeFaST: An improved method for OTU assignment by generalising Swarm's fastidious clustering approach", Bielefeld University.

  PUB | Dateien verfügbar | DOI
   
• [51]
  

  2018 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2931048

  Müller, R., & Nebel, M., 2018. GeFaST: An improved method for OTU assignment by generalising Swarm’s fastidious clustering approach. BMC Bioinformatics, 19(1): 321.

  PUB | PDF | DOI | WoS | PubMed | Europe PMC
   
• [50]
  

  2016 | Zeitschriftenaufsatz | PUB-ID: 2909992

  Laube, U., & Nebel, M., 2016. Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algorithmica, 74(4), p 1224--1266.

  PUB | DOI | WoS
   
• [49]
  

  2016 | Preprint | PUB-ID: 2909994

  Nebel, M., Neumann, E., & Wild, S., 2016. Median-of-k Jumplists.

  PUB | arXiv
   
• [48]
  

  2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909991

  Wild, S., Nebel, M., & Mahmoud, H., 2016. Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. Algorithmica, 74(1), p 485-506.

  PUB | DOI | WoS
   
• [47]
  

  2016 | Zeitschriftenaufsatz | PUB-ID: 2909996

  Lopez-Ortiz, A., et al., 2016. Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101). Dagstuhl Reports, 6(3), p 1--23.

  PUB | DOI
   
• [46]
  

  2016 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909993

  Nebel, 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), p 632-683.

  PUB | DOI | WoS | arXiv
   
• [45]
  

  2015 | Zeitschriftenaufsatz | PUB-ID: 2909997

  Müller, R., & Nebel, M., 2015. Combinatorics of RNA Secondary Structures with Base Triples. Journal of Computational Biology, 22(7), p 619--648.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [44]
  

  2015 | Konferenzbeitrag | PUB-ID: 2909999

  Martinez, C., Nebel, M., & Wild, S., 2015. Analysis of Branch Misses in Quicksort. In Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2015, San Diego, CA, USA, January 4, 2015. Society for Industrial and Applied Mathematics, pp. 114--128.

  PUB | DOI | arXiv
   
• [43]
  

  2015 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2910050

  Codish, M., et al., 2015. Applying Sorting Networks to Synthesize Optimized Sorting Libraries. In M. Falaschi, ed. Logic-Based Program Synthesis and Transformation - 25th International Symposium, LOPSTR 2015, Siena, Italy, July 13-15, 2015. Revised Selected Papers. Lecture Notes in Computer Science. no.9527 Berlin ; Heidelberg: Springer, pp. 127-142.

  PUB | DOI | arXiv
   
• [42]
  

  2015 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2909998

  Wild, S., Nebel, M., & Neininger, R., 2015. Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Transactions on Algorithms (TALG), 11(3): 22.

  PUB | DOI | WoS | arXiv
   
• [41]
  

  2014 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2910000

  Nebel, M., & Wild, S., 2014. Pivot Sampling in Java 7's Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme. In M. Bousquet-Mélou & M. Soria, eds. Proceedings of the 25th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms. DMTCS-HAL Proceedings Series. pp. 325-338.

  PUB | arXiv
   
• [40]
  

  2013 | Preprint | PUB-ID: 2910007

  Wild, S., Nebel, M., & Mahmoud, H., 2013. Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm.

  PUB | arXiv
   
• [39]
  

  2013 | Konferenzband | PUB-ID: 2910004

  M. Nebel & W. Szpankowski, eds., 2013. Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013, SIAM.

  PUB | DOI
   
• [38]
  

  2013 | Preprint | PUB-ID: 2910006

  Huang, F.W.D., Nebel, M., & Reidys, C.M., 2013. Uniform generation of RNA pseudoknot structures with genus filtration.

  PUB | arXiv
   
• [37]
  

  2013 | Konferenzbeitrag | PUB-ID: 2910003

  Wild, S., et al., 2013. Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. In Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, ALENEX 2013, New Orleans, Louisiana, USA, January 7, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics, pp. 55--69.

  PUB | DOI
   
• [36]
  

  2012 | Zeitschriftenaufsatz | PUB-ID: 2910010

  Scheid, 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.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [35]
  

  2012 | Zeitschriftenaufsatz | PUB-ID: 2910009

  M. Reidys, C., et al., 2012. Addendum: topology and prediction of RNA pseudoknots. Bioinformatics, 28(2), p 300.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [34]
  

  2012 | Zeitschriftenaufsatz | PUB-ID: 2910012

  Nebel, M., & Weinberg, F., 2012. Algebraic and Combinatorial Properties of Common RNA Pseudoknot Classes with Applications. Journal of Computational Biology, 19(10), p 1134--1150.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [33]
  

  2012 | Konferenzbeitrag | PUB-ID: 2910014

  Nebel, M., & Scheid, A., 2012. A n^2 RNA Secondary Structure Prediction Algorithm. In BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1 - 4 February, 2012. pp. 66--75.

  PUB
   
• [32]
  

  2012 | Zeitschriftenaufsatz | PUB-ID: 2910011

  Yu Jin, E., & Nebel, M., 2012. A Combinatorial Proof of the Recurrence for Rook Paths. Electr. J. Comb., 19(1), p P57.

  PUB
   
• [31]
  

  2012 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2910013

  Yu Jin, E., & Nebel, M., 2012. The Expected Order of Saturated RNA Secondary Structures. In H. - K. Hwang & C. Martínez, eds. 2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). SIAM, pp. 84-91.

  PUB | DOI
   
• [30]
  

  2012 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2910015

  Wild, S., & Nebel, M., 2012. Average Case Analysis of Java 7's Dual Pivot Quicksort. In L. Epstein & P. Ferragina, eds. Algorithms - ESA 2012. 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings. Lecture Notes in Computer Science. no.7501 Berlin ; Heidelberg: Springer, pp. 825-836.

  PUB | DOI | arXiv
   
• [29]
  

  2011 | Zeitschriftenaufsatz | PUB-ID: 2910016

  Weinberg, F., & Nebel, M., 2011. Applying Length-Dependent Stochastic Context-Free Grammars to RNA Secondary Structure Prediction. Algorithms, 4(4), p 223--238.

  PUB | DOI
   
• [28]
  

  2011 | Zeitschriftenaufsatz | PUB-ID: 2910017

  Nebel, M., Scheid, A., & Weinberg, F., 2011. Random generation of RNA secondary structures according to native distributions. Algorithms for Molecular Biology, 6(1): 24.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [27]
  

  2011 | Zeitschriftenaufsatz | PUB-ID: 2910021

  Nebel, M., & Scheid, A., 2011. Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model. IEEE/ACM Trans. Comput. Biology Bioinform., 8(6), p 1468--1482.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [26]
  

  2011 | Zeitschriftenaufsatz | PUB-ID: 2910022

  Nebel, M., & Scheid, A., 2011. Evaluation of a sophisticated SCFG design for RNA secondary structure prediction. Theory in Biosciences, 130(4), p 313--336.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [25]
  

  2011 | Zeitschriftenaufsatz | PUB-ID: 2910018

  M. Reidys, C., et al., 2011. Topology and prediction of RNA pseudoknots. Bioinformatics, 27(8), p 1076--1085.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [24]
  

  2011 | Zeitschriftenaufsatz | PUB-ID: 2910019

  Nebel, M., et al., 2011. Jaguc - a Software package for Environmental Diversity Analyses. J. Bioinformatics and Computational Biology, 9(6), p 749--773.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [23]
  

  2011 | Zeitschriftenaufsatz | PUB-ID: 2910020

  Nebel, M., M. Reidys, C., & R. Wang, R., 2011. Loops in Canonical RNA Pseudoknot Structures. Journal of Computational Biology, 18(12), p 1793--1806.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [22]
  

  2011 | Konferenzbeitrag | PUB-ID: 2910023

  Afzal Uzmi, Z., et al., 2011. SMALTA: practical and near-optimal FIB aggregation. In Association for Computing Machinery, ed. Proceedings of the 2011 Conference on Emerging Networking Experiments and Technologies, Co-NEXT '11, Tokyo, Japan, December 6-9, 2011. ACM Digital Library. New York, NY: ACM Press, pp. 29.

  PUB | DOI
   
• [21]
  

  2011 | Preprint | PUB-ID: 2910025

  Yu Jin, E., & Nebel, M., 2011. The Expected Order of Saturated RNA Secondary Structures.

  PUB | arXiv
   
• [20]
  

  2011 | Sammelwerksbeitrag | PUB-ID: 2910024

  Nebel, M., 2011. Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm. In B. Vöcking, ed. Algorithms Unplugged. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 47--56.

  PUB | DOI
   
• [19]
  

  2010 | Zeitschriftenaufsatz | PUB-ID: 2910026

  Laube, U., & Nebel, M., 2010. Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci., 411(1), p 188--212.

  PUB | DOI | WoS
   
• [18]
  

  2010 | Konferenzbeitrag | PUB-ID: 2910027

  Weinberg, F., & Nebel, M., 2010. Extending Stochastic Context-Free Grammars for an Application in Bioinformatics. In Language and Automata Theory and Applications, 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 585--595.

  PUB | DOI
   
• [17]
  

  2009 | Zeitschriftenaufsatz | PUB-ID: 2910028

  Nebel, M., & Scheid, A., 2009. On quantitative effects of RNA shape abstraction. Theory in Biosciences, 128(4), p 211--225.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [16]
  

  2008 | Sammelwerksbeitrag | PUB-ID: 2910030

  Nebel, M., 2008. Texte durchsuchen - aber schnell! Der Boyer-Moore-Horspool Algorithmus. In Taschenbuch der Algorithmen. eXamen.press. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 51--60.

  PUB | DOI
   
• [15]
  

  2007 | Konferenzbeitrag | PUB-ID: 2910032

  Nebel, M., 2007. Compact Descriptions for Efficient Algorithms. In 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20 - 22, 2007. pp. 27--40.

  PUB
   
• [14]
  

  2007 | Zeitschriftenaufsatz | PUB-ID: 2910031

  Nebel, M., 2007. On the lexicographical generation of compressed codes. Inf. Process. Lett., 104(3), p 95--100.

  PUB | DOI | WoS
   
• [13]
  

  2006 | Zeitschriftenaufsatz | PUB-ID: 2910033

  Flajolet, P., Nebel, M., & Prodinger, H., 2006. The scientific works of Rainer Kemp (1949-2004). Theor. Comput. Sci., 355(3), p 371--381.

  PUB | DOI | WoS
   
• [12]
  

  2006 | Zeitschriftenaufsatz | PUB-ID: 2910034

  Nebel, M., 2006. Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. Theor. Comput. Sci., 359(1-3), p 329--343.

  PUB | DOI | WoS
   
• [11]
  

  2004 | Konferenzbeitrag | PUB-ID: 2910036

  Nebel, M., 2004. Identifying Good Predictions of RNA Secondary Structure. In Biocomputing 2004, Proceedings of the Pacific Symposium, Hawaii, USA, 6-10 January 2004. pp. 423--434.

  PUB
   
• [10]
  

  2003 | Zeitschriftenaufsatz | PUB-ID: 2910037

  Nebel, M., 2003. Combinatorial Properties of RNA Secondary Structures. Journal of Computational Biology, 9(3), p 541--573.

  PUB | DOI | WoS | PubMed | Europe PMC
   
• [9]
  

  2002 | Zeitschriftenaufsatz | PUB-ID: 2910038

  Nebel, M., 2002. The Stack-Size of Combinatorial Tries Revisited. Discrete Mathematics & Theoretical Computer Science, 5(1), p 1--16.

  PUB
   
• [8]
  

  2002 | Zeitschriftenaufsatz | PUB-ID: 2910040

  Nebel, M., 2002. The stack-size of tries: a combinatorial study. Theor. Comput. Sci., 270(1-2), p 441--461.

  PUB | DOI | WoS
   
• [7]
  

  2002 | Zeitschriftenaufsatz | PUB-ID: 2910039

  Nebel, M., 2002. A unified approach to the analysis of Horton-Strahler parameters of binary tree structures. Random Struct. Algorithms, 21(3-4), p 252--277.

  PUB | DOI | WoS
   
• [6]
  

  2001 | Zeitschriftenaufsatz | PUB-ID: 2910042

  Nebel, M., 2001. On the Power of Subroutines for Finite State Machines. Journal of Automata, Languages and Combinatorics, 6(1), p 51--74.

  PUB
   
• [5]
  

  2001 | Zeitschriftenaufsatz | PUB-ID: 2910041

  Bourdon, J., Nebel, M., & Vallee, B., 2001. On the Stack-Size of General Tries. ITA, 35(2), p 163--185.

  PUB | DOI | WoS
   
• [4]
  

  2000 | Zeitschriftenaufsatz | PUB-ID: 2910043

  Nebel, M., 2000. On the Horton-Strahler number for combinatorial tries. ITA, 34(4), p 279--296.

  PUB | DOI | WoS
   
• [3]
  

  1997 | Zeitschriftenaufsatz | PUB-ID: 2910045

  Nebel, M., 1997. New Results on the Stack Ramification of Binary Trees. Journal of Automata, Languages and Combinatorics, 2(3), p 161--176.

  PUB
   
• [2]
  

  1997 | Konferenzbeitrag | PUB-ID: 2910046

  Nebel, M., 1997. On the Average Complexity of the Membership Problem for a Generalized Dyck Language. In Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Krakow, Poland, September 1-3, 1997, Proceedings. Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 352--363.

  PUB | DOI
   
• [1]
  

  1996 | Zeitschriftenaufsatz | PUB-ID: 2910047

  Nebel, M., 1996. Digital Search Trees with Keys of Variable Length. ITA, 30(6), p 507--520.

  PUB