팔로우
Zsuzsanna Lipták
Zsuzsanna Lipták
Associate Professor, University of Verona
univr.it의 이메일 확인됨 - 홈페이지
제목
인용
인용
연도
SIRIUS: decomposing isotope patterns for metabolite identification
S Böcker, MC Letzel, Z Lipták, A Pervukhin
Bioinformatics 25 (2), 218-224, 2009
3842009
AUDENS: a tool for automated peptide de novo sequencing
J Grossmann, FF Roos, M Cieliebak, Z Lipták, LK Mathis, M Müller, ...
Journal of proteome research 4 (5), 1768-1774, 2005
113*2005
Algorithms for jumbled pattern matching in strings
P Burcsi, F Cicalese, G Fici, Z Lipták
International Journal of Foundations of Computer Science 23 (02), 357-374, 2012
902012
A fast and simple algorithm for the Money Changing Problem
S Bocker, Z Lipták
Algorithmica 48 (4), 413-432, 2007
882007
Searching for jumbled patterns in strings
F Cicalese, G Fici, Z Lipták
Proceedings of the Prague Stringology Conference 2009, 105-117, 2009
622009
On approximate jumbled pattern matching in strings
P Burcsi, F Cicalese, G Fici, Z Lipták
Theory of Computing Systems 50, 35-51, 2012
562012
An overview of the wcd EST clustering tool
S Hazelhurst, W Hide, Z Lipták, R Nogueira, R Starfield
Bioinformatics 24 (13), 1542-1546, 2008
522008
On table arrangements, scrabble freaks, and jumbled pattern matching
P Burcsi, F Cicalese, G Fici, Z Lipták
Fun with Algorithms: 5th International Conference, FUN 2010, Ischia, Italy …, 2010
462010
Decomposing metabolomic isotope patterns
S Böcker, MC Letzel, Z Lipták, A Pervukhin
Algorithms in Bioinformatics: 6th International Workshop, WABI 2006, Zurich …, 2006
442006
The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(ka1)
S Böcker, Z Lipták
International Computing and Combinatorics Conference, 965-974, 2005
422005
Binary jumbled string matching for highly run-length compressible texts
G Badkobeh, G Fici, S Kroon, Z Lipták
Information Processing Letters 113 (17), 604-608, 2013
35*2013
Algorithmic complexity of protein identification: Combinatorics of weighted strings
M Cieliebak, T Erlebach, Z Lipták, J Stoye, E Welzl
Discrete Applied Mathematics 137 (1), 27-46, 2004
322004
Decomp—from interpreting Mass Spectrometry peaks to solving the Money Changing Problem
S Böcker, Z Lipták, M Martin, A Pervukhin, H Sudek
Bioinformatics 24 (4), 591-593, 2008
302008
On prefix normal words
G Fici, Z Lipták
Developments in Language Theory: 15th International Conference, DLT 2011 …, 2011
292011
Novel results on the number of runs of the Burrows-Wheeler-Transform
S Giuliani, S Inenaga, Z Lipták, N Prezza, M Sciortino, A Toffanello
SOFSEM 2021: Theory and Practice of Computer Science: 47th International …, 2021
282021
Efficient mass decomposition
S Böcker, Z Lipták
Proceedings of the 2005 ACM symposium on Applied computing, 151-157, 2005
282005
KABOOM! A new suffix array based algorithm for clustering expression data
S Hazelhurst, Z Lipták
Bioinformatics 27 (24), 3348-3355, 2011
272011
Computing the original eBWT faster, simpler, and with less memory
C Boucher, D Cenzato, Z Lipták, M Rossi, M Sciortino
International Symposium on String Processing and Information Retrieval, 129-142, 2021
262021
On prefix normal words and prefix normal forms
P Burcsi, G Fici, Z Lipták, F Ruskey, J Sawada
Theoretical Computer Science 659, 1-13, 2017
242017
On the number of closed factors in a word
G Badkobeh, G Fici, Z Lipták
Language and Automata Theory and Applications: 9th International Conference …, 2015
212015
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20