PUB - Publikationen an der Universität Bielefeld

Alle markieren

• [13]
  

  2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2474531

  Burcsi, P., et al., 2012. On Approximate Jumbled Pattern Matching in Strings. Theory of Computing Systems, 50(1), p 35-51.

  PUB | DOI | WoS
   
• [12]
  

  2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2493233

  Burcsi, P., et al., 2012. ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS. International Journal of Foundations of Computer Science, 23(02), p 357-374.

  PUB | DOI | WoS | arXiv
   
• [11]
  

  2011 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2425344

  Cicalese, F., Erdős, P.L.P., & Lipták, Z., 2011. Efficient Reconstruction of RC-Equivalent Strings. In Combinatorial Algorithms : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Lecture Notes in Computer Science. no.6460 Berlin, Heidelberg: Springer, pp. 349-362.

  PUB | DOI
   
• [10]
  

  2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2425332

  Burcsi, P., et al., 2010. On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. In P. Boldi, ed. Fun with Algorithms: 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings. Lecture Notes in Computer Science. no.6099 Berlin, Heidelberg: Springer, pp. 89-101.

  PUB | DOI
   
• [9]
  

  2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592737

  Boecker, S., et al., 2008. DECOMP - from interpreting mass spectrometry peaks to solving the money changing problem. BIOINFORMATICS, 24(4), p 591-593.

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

  2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587304

  Hazelhurst, S., et al., 2008. An overview of the wcd EST clustering tool. BIOINFORMATICS, 24(13), p 1542-1546.

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

  2007 | Report | Veröffentlicht | PUB-ID: 2308810

  Böcker, S., et al., 2007. Identifying metabolites with integer decomposition techniques, using only their mass spectrometric isotope patterns, Forschungsberichte der Technischen Fakultät, Abteilung Informationstechnik / Universität Bielefeld, Bielefeld: Technical Faculty, Bielefeld University.

  PUB | PDF
   
• [6]
  

  2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1601976

  Böcker, S., & Lipták, Z., 2005. The Money Changing Problem revisited: Computing the Frobenius number in time O(k a(1)). In L. Wang, ed. Computing and Combinatorics : 11th Annual International Conference, COCOON 2005 Kunming, China, August 16–19, 2005, Proceedings. Lecture Notes in Computer Science. no.3595 Berlin: Springer, pp. 965-974.

  PUB | DOI | WoS
   
• [5]
  

  2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2308823

  Böcker, S., & Lipták, Z., 2005. Efficient mass decomposition. In L. M. Liebrock, ed. Proceedings of the 2005 ACM symposium on Applied computing (SAC '05). New York, NY: ACM, pp. 151-157.

  PUB | DOI
   
• [4]
  

  2005 | Bielefelder E-Dissertation | PUB-ID: 2302056

  Lipták, Z., 2005. Strings in proteomics and transcriptomics : algorithmic and combinatorial questions in mass spectrometry and EST clustering, Bielefeld (Germany): Bielefeld University.

  PUB | Dateien verfügbar
   
• [3]
  

  2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1601941

  Grossmann, J., et al., 2005. AUDENS: A tool for automated peptide de novo sequencing. Journal of Proteome Research, 4(5), p 1768-1774.

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

  2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919000

  Cieliebak, M., et al., 2002. Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. In Proc. of IFIP TCS 2002. pp. 143-156.

  PUB
   
• [1]
  

  2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2309108

  Lipták, Z., & Nickelsen, A., 2000. Broadcasting in Complete Networks with Dynamic Edge Faults. In F. Butelle, ed. Procedings of the 4th International Conference on Principles of Distributed Systems, OPODIS 2000. pp. 123-142.

  PUB