13 Publikationen

Alle markieren

[13]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2474531
P. Burcsi, et al., “On Approximate Jumbled Pattern Matching in Strings”, Theory of Computing Systems, vol. 50, 2012, pp. 35-51.
PUB | DOI | WoS
 
[12]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2493233
P. Burcsi, et al., “ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS”, International Journal of Foundations of Computer Science, vol. 23, 2012, pp. 357-374.
PUB | DOI | WoS | arXiv
 
[11]
2011 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2425344
F. Cicalese, P.L.P. Erdős, and Z. Lipták, “Efficient Reconstruction of RC-Equivalent Strings”, Combinatorial Algorithms : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, Lecture Notes in Computer Science, vol. 6460, Berlin, Heidelberg: Springer, 2011, pp.349-362.
PUB | DOI
 
[10]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2425332
P. Burcsi, et al., “On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching”, Fun with Algorithms: 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings, P. Boldi, ed., Lecture Notes in Computer Science, vol. 6099, Berlin, Heidelberg: Springer, 2010, pp.89-101.
PUB | DOI
 
[9]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587304
S. Hazelhurst, et al., “An overview of the wcd EST clustering tool”, BIOINFORMATICS, vol. 24, 2008, pp. 1542-1546.
PUB | DOI | WoS | PubMed | Europe PMC
 
[8]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592737
S. Boecker, et al., “DECOMP - from interpreting mass spectrometry peaks to solving the money changing problem”, BIOINFORMATICS, vol. 24, 2008, pp. 591-593.
PUB | DOI | WoS | PubMed | Europe PMC
 
[7]
2007 | Report | Veröffentlicht | PUB-ID: 2308810 OA
S. Böcker, et al., 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, 2007.
PUB | PDF
 
[6]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1601976
S. Böcker and Z. Lipták, “The Money Changing Problem revisited: Computing the Frobenius number in time O(k a(1))”, Computing and Combinatorics : 11th Annual International Conference, COCOON 2005 Kunming, China, August 16–19, 2005, Proceedings, L. Wang, ed., Lecture Notes in Computer Science, vol. 3595, Berlin: Springer, 2005, pp.965-974.
PUB | DOI | WoS
 
[5]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2308823
S. Böcker and Z. Lipták, “Efficient mass decomposition”, Proceedings of the 2005 ACM symposium on Applied computing (SAC '05), L.M. Liebrock, ed., New York, NY: ACM, 2005, pp.151-157.
PUB | DOI
 
[4]
2005 | Bielefelder E-Dissertation | PUB-ID: 2302056 OA
Z. Lipták, Strings in proteomics and transcriptomics : algorithmic and combinatorial questions in mass spectrometry and EST clustering, Bielefeld (Germany): Bielefeld University, 2005.
PUB | Datei
 
[3]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1601941
J. Grossmann, et al., “AUDENS: A tool for automated peptide de novo sequencing”, Journal of Proteome Research, vol. 4, 2005, pp. 1768-1774.
PUB | DOI | WoS | PubMed | Europe PMC
 
[2]
2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919000
M. Cieliebak, et al., “Algorithmic Complexity of Protein Identification: Searching in Weighted Strings”, Proc. of IFIP TCS 2002, 2002, pp.143-156.
PUB
 
[1]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2309108
Z. Lipták and A. Nickelsen, “Broadcasting in Complete Networks with Dynamic Edge Faults”, Procedings of the 4th International Conference on Principles of Distributed Systems, OPODIS 2000, F. Butelle, ed., 2000, pp.123-142.
PUB
 

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: ieee

Export / Einbettung

13 Publikationen

Alle markieren

[13]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2474531
P. Burcsi, et al., “On Approximate Jumbled Pattern Matching in Strings”, Theory of Computing Systems, vol. 50, 2012, pp. 35-51.
PUB | DOI | WoS
 
[12]
2012 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 2493233
P. Burcsi, et al., “ALGORITHMS FOR JUMBLED PATTERN MATCHING IN STRINGS”, International Journal of Foundations of Computer Science, vol. 23, 2012, pp. 357-374.
PUB | DOI | WoS | arXiv
 
[11]
2011 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2425344
F. Cicalese, P.L.P. Erdős, and Z. Lipták, “Efficient Reconstruction of RC-Equivalent Strings”, Combinatorial Algorithms : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers, Lecture Notes in Computer Science, vol. 6460, Berlin, Heidelberg: Springer, 2011, pp.349-362.
PUB | DOI
 
[10]
2010 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2425332
P. Burcsi, et al., “On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching”, Fun with Algorithms: 5th International Conference, FUN 2010, Ischia, Italy, June 2-4, 2010. Proceedings, P. Boldi, ed., Lecture Notes in Computer Science, vol. 6099, Berlin, Heidelberg: Springer, 2010, pp.89-101.
PUB | DOI
 
[9]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1587304
S. Hazelhurst, et al., “An overview of the wcd EST clustering tool”, BIOINFORMATICS, vol. 24, 2008, pp. 1542-1546.
PUB | DOI | WoS | PubMed | Europe PMC
 
[8]
2008 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1592737
S. Boecker, et al., “DECOMP - from interpreting mass spectrometry peaks to solving the money changing problem”, BIOINFORMATICS, vol. 24, 2008, pp. 591-593.
PUB | DOI | WoS | PubMed | Europe PMC
 
[7]
2007 | Report | Veröffentlicht | PUB-ID: 2308810 OA
S. Böcker, et al., 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, 2007.
PUB | PDF
 
[6]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1601976
S. Böcker and Z. Lipták, “The Money Changing Problem revisited: Computing the Frobenius number in time O(k a(1))”, Computing and Combinatorics : 11th Annual International Conference, COCOON 2005 Kunming, China, August 16–19, 2005, Proceedings, L. Wang, ed., Lecture Notes in Computer Science, vol. 3595, Berlin: Springer, 2005, pp.965-974.
PUB | DOI | WoS
 
[5]
2005 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2308823
S. Böcker and Z. Lipták, “Efficient mass decomposition”, Proceedings of the 2005 ACM symposium on Applied computing (SAC '05), L.M. Liebrock, ed., New York, NY: ACM, 2005, pp.151-157.
PUB | DOI
 
[4]
2005 | Bielefelder E-Dissertation | PUB-ID: 2302056 OA
Z. Lipták, Strings in proteomics and transcriptomics : algorithmic and combinatorial questions in mass spectrometry and EST clustering, Bielefeld (Germany): Bielefeld University, 2005.
PUB | Datei
 
[3]
2005 | Zeitschriftenaufsatz | Veröffentlicht | PUB-ID: 1601941
J. Grossmann, et al., “AUDENS: A tool for automated peptide de novo sequencing”, Journal of Proteome Research, vol. 4, 2005, pp. 1768-1774.
PUB | DOI | WoS | PubMed | Europe PMC
 
[2]
2002 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 1919000
M. Cieliebak, et al., “Algorithmic Complexity of Protein Identification: Searching in Weighted Strings”, Proc. of IFIP TCS 2002, 2002, pp.143-156.
PUB
 
[1]
2000 | Konferenzbeitrag | Veröffentlicht | PUB-ID: 2309108
Z. Lipták and A. Nickelsen, “Broadcasting in Complete Networks with Dynamic Edge Faults”, Procedings of the 4th International Conference on Principles of Distributed Systems, OPODIS 2000, F. Butelle, ed., 2000, pp.123-142.
PUB
 

Suche

Publikationen filtern

Darstellung / Sortierung

Zitationsstil: ieee

Export / Einbettung