default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZsuzsanna Lipták
Person information
- affiliation: University of Verona, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j27]Elena Biagi, Davide Cenzato, Zsuzsanna Lipták, Giuseppe Romana:
On the number of equal-letter runs of the bijective Burrows-Wheeler transform. Theor. Comput. Sci. 1027: 115004 (2025)- [e3]Zsuzsanna Lipták
, Edleno Silva de Moura, Karina Figueroa, Ricardo Baeza-Yates:
String Processing and Information Retrieval - 31st International Symposium, SPIRE 2024, Puerto Vallarta, Mexico, September 23-25, 2024, Proceedings. Lecture Notes in Computer Science 14899, Springer 2025, ISBN 978-3-031-72199-1 [contents] - 2024
- [j26]Zsuzsanna Lipták, Francesco Masillo, Simon J. Puglisi:
Suffix sorting via matching statistics. Algorithms Mol. Biol. 19(1): 11 (2024) - [j25]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
r-indexing the eBWT. Inf. Comput. 298: 105155 (2024) - [c38]Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro:
BAT-LZ out of hell. CPM 2024: 21:1-21:17 - [c37]Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro:
A Textbook Solution for Dynamic Strings. ESA 2024: 86:1-86:16 - [c36]Zsuzsanna Lipták, Luca Parmigiani:
A BWT-Based Algorithm for Random de Bruijn Sequence Construction. LATIN (1) 2024: 130-145 - [c35]Zsuzsanna Lipták, Martina Luca, Francesco Masillo, Simon J. Puglisi:
Fast Matching Statistics for Sets of Long Similar Strings. PSC 2024: 3-15 - [i23]Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro:
BAT-LZ Out of Hell. CoRR abs/2403.09893 (2024) - [i22]Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro:
A simpler data structure for dynamic strings. CoRR abs/2403.13162 (2024) - [i21]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Bit catastrophes for the Burrows-Wheeler Transform. CoRR abs/2404.10426 (2024) - 2023
- [c34]Davide Cenzato, Veronica Guerrini, Zsuzsanna Lipták, Giovanna Rosone:
Computing the optimal BWT of very large string collections. DCC 2023: 71-80 - [c33]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino, Cristian Urbina:
Bit Catastrophes for the Burrows-Wheeler Transform. DLT 2023: 86-99 - [c32]Elena Biagi, Davide Cenzato, Zsuzsanna Lipták, Giuseppe Romana:
On the Number of Equal-Letter Runs of the Bijective Burrows-Wheeler Transform. ICTCS 2023: 129-142 - [c31]Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro, Aaron Williams:
Constant Time and Space Updates for the Sigma-Tau Problem. SPIRE 2023: 323-330 - [e2]Laurent Bulteau, Zsuzsanna Lipták:
34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, June 26-28, 2023, Marne-la-Vallée, France. LIPIcs 259, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-276-1 [contents] - [i20]Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro:
Maintaining the cycle structure of dynamic permutations. CoRR abs/2306.04470 (2023) - 2022
- [c30]Davide Cenzato, Zsuzsanna Lipták:
A Theoretical and Experimental Analysis of BWT Variants for String Collections. CPM 2022: 25:1-25:18 - [c29]Marco Oliva, Davide Cenzato, Massimiliano Rossi, Zsuzsanna Lipták, Travis Gagie, Christina Boucher:
CSTs for Terabyte-Sized Data. DCC 2022: 93-102 - [c28]Davide Cenzato, Zsuzsanna Lipták:
On different variants of the Burrows-Wheeler-Transform of string collections. DCC 2022: 448 - [c27]Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo:
When a Dollar in a Fully Clustered Word Makes a BWT. ICTCS 2022: 122-135 - [c26]Golnaz Badkobeh, Sara Giuliani, Zsuzsanna Lipták, Simon J. Puglisi:
On Compressing Collections of Substring Samples. ICTCS 2022: 136-147 - [c25]Zsuzsanna Lipták, Francesco Masillo, Simon J. Puglisi:
Suffix Sorting via Matching Statistics. WABI 2022: 20:1-20:15 - [i19]Davide Cenzato, Zsuzsanna Lipták:
A theoretical and experimental analysis of BWT variants for string collections. CoRR abs/2202.13235 (2022) - [i18]Zsuzsanna Lipták, Francesco Masillo, Simon J. Puglisi:
Suffix sorting via matching statistics. CoRR abs/2207.00972 (2022) - [i17]Davide Cenzato, Veronica Guerrini, Zsuzsanna Lipták, Giovanna Rosone:
Computing the optimal BWT of very large string collections. CoRR abs/2212.01156 (2022) - 2021
- [j24]Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi:
Pattern Discovery in Colored Strings. ACM J. Exp. Algorithmics 26: 1.1:1-1.1:26 (2021) - [j23]Sara Giuliani, Zsuzsanna Lipták, Francesco Masillo, Romeo Rizzi:
When a dollar makes a BWT. Theor. Comput. Sci. 857: 123-146 (2021) - [j22]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On infinite prefix normal words. Theor. Comput. Sci. 859: 134-148 (2021) - [c24]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. SOFSEM 2021: 249-262 - [c23]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
r-Indexing the eBWT. SPIRE 2021: 3-12 - [c22]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
Computing the Original eBWT Faster, Simpler, and with Less Memory. SPIRE 2021: 129-142 - [i16]Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino:
Computing the original eBWT faster, simpler, and with less memory. CoRR abs/2106.11191 (2021) - 2020
- [j21]Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842: 86-99 (2020) - [c21]Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi:
Pattern Discovery in Colored Strings. SEA 2020: 12:1-12:14 - [i15]Péter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Rajeev Raman, Joe Sawada:
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word. CoRR abs/2003.03222 (2020) - [i14]Zsuzsanna Lipták, Simon J. Puglisi, Massimiliano Rossi:
Pattern Discovery in Colored Strings. CoRR abs/2004.04858 (2020) - [i13]Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Nicola Prezza, Marinella Sciortino, Anna Toffanello:
Novel Results on the Number of Runs of the Burrows-Wheeler-Transform. CoRR abs/2008.08506 (2020)
2010 – 2019
- 2019
- [c20]Sara Giuliani, Zsuzsanna Lipták, Romeo Rizzi:
When a Dollar Makes a BWT. ICTCS 2019: 20-33 - [c19]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On Infinite Prefix Normal Words. SOFSEM 2019: 122-135 - [i12]Sara Giuliani, Zsuzsanna Lipták, Romeo Rizzi:
When a Dollar Makes a BWT. CoRR abs/1908.09125 (2019) - 2018
- [j20]Zsuzsanna Lipták, W. F. Smyth:
Preface. Discret. Appl. Math. 246: 1 (2018) - [j19]Jan Kratochvíl, Zsuzsanna Lipták:
Preface. Eur. J. Comb. 68: 1-2 (2018) - [j18]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A new generation algorithm for prefix normal words. Theor. Comput. Sci. 743: 38-52 (2018) - [c18]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. LATA 2018: 207-219 - [i11]Gabriele Fici, Zsuzsanna Lipták:
On Prefix Normal Words. CoRR abs/1805.12405 (2018) - [i10]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
On Infinite Prefix Normal Words. CoRR abs/1811.06273 (2018) - 2017
- [j17]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659: 1-13 (2017) - [i9]Peter Burcsi, Zsuzsanna Lipták, W. F. Smyth:
On the Parikh-de-Bruijn grid. CoRR abs/1711.06264 (2017) - [i8]Ferdinando Cicalese, Zsuzsanna Lipták, Massimiliano Rossi:
Bubble-Flip - A New Generation Algorithm for Prefix Normal Words. CoRR abs/1712.05876 (2017) - 2016
- [c17]Dénes Bartha, Peter Burcsi, Zsuzsanna Lipták:
Reconstruction of Trees from Jumbled and Weighted Subtrees. CPM 2016: 10:1-10:13 - [e1]Zsuzsanna Lipták, William F. Smyth:
Combinatorial Algorithms - 26th International Workshop, IWOCA 2015, Verona, Italy, October 5-7, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9538, Springer 2016, ISBN 978-3-319-29515-2 [contents] - [i7]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Prefix Normal Words and Prefix Normal Forms. CoRR abs/1611.09017 (2016) - 2015
- [j16]Zsuzsanna Lipták, Bill Smyth:
IWOCA 2015 in Verona, Italy. Bull. EATCS 115 (2015) - [j15]Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták:
StringMasters 2012 & 2013 special issue - volume 2. J. Discrete Algorithms 32: 1-2 (2015) - [c16]Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták:
On the Number of Closed Factors in a Word. LATA 2015: 381-390 - 2014
- [j14]Maxime Crochemore, Jacqueline W. Daykin, Zsuzsanna Lipták:
StringMasters 2012 & 2013 special issue - volume 1. J. Discrete Algorithms 28: 1 (2014) - [c15]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CPM 2014: 60-69 - [c14]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. FUN 2014: 74-88 - [i6]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
On Combinatorial Generation of Prefix Normal Words. CoRR abs/1401.6346 (2014) - [i5]Peter Burcsi, Gabriele Fici, Zsuzsanna Lipták, Frank Ruskey, Joe Sawada:
Normal, Abby Normal, Prefix Normal. CoRR abs/1404.2824 (2014) - 2013
- [j13]Zsuzsanna Lipták:
Report on StringMasters 2013. Bull. EATCS 110: 89-91 (2013) - [j12]Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták:
Binary jumbled string matching for highly run-length compressible texts. Inf. Process. Lett. 113(17): 604-608 (2013) - [c13]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. SPIRE 2013: 56-63 - [i4]Ferdinando Cicalese, Travis Gagie, Emanuele Giaquinta, Eduardo Sany Laber, Zsuzsanna Lipták, Romeo Rizzi, Alexandru I. Tomescu:
Indexes for Jumbled Pattern Matching in Strings, Trees and Graphs. CoRR abs/1304.5560 (2013) - [i3]Golnaz Badkobeh, Gabriele Fici, Zsuzsanna Lipták:
A Note on Words With the Smallest Number of Closed Factors. CoRR abs/1305.6395 (2013) - 2012
- [j11]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Algorithms for Jumbled Pattern Matching in Strings. Int. J. Found. Comput. Sci. 23(2): 357-374 (2012) - [j10]Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták:
A linear algorithm for string reconstruction in the reverse complement equivalence model. J. Discrete Algorithms 14: 37-54 (2012) - [j9]Alberto Apostolico, Péter L. Erdös, Ervin Györi, Zsuzsanna Lipták, Cinzia Pizzi:
Efficient algorithms for the periodic subgraphs mining problem. J. Discrete Algorithms 17: 24-30 (2012) - [j8]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
On Approximate Jumbled Pattern Matching in Strings. Theory Comput. Syst. 50(1): 35-51 (2012) - [c12]Carl Barton, Emilios Cambouropoulos, Costas S. Iliopoulos, Zsuzsanna Lipták:
Melodic String Matching via Interval Consolidation and Fragmentation. AIAI (2) 2012: 460-469 - [i2]Golnaz Badkobeh, Gabriele Fici, Steve Kroon, Zsuzsanna Lipták:
Binary Jumbled String Matching: Faster Indexing in Less Space. CoRR abs/1206.2523 (2012) - 2011
- [j7]Scott Hazelhurst, Zsuzsanna Lipták:
KABOOM! A new suffix array based algorithm for clustering expression data. Bioinform. 27(24): 3348-3355 (2011) - [c11]Gabriele Fici, Zsuzsanna Lipták:
On Prefix Normal Words. Developments in Language Theory 2011: 228-238 - [i1]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Algorithms for Jumbled Pattern Matching in Strings. CoRR abs/1102.1746 (2011) - 2010
- [c10]Peter Burcsi, Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
On Table Arrangements, Scrabble Freaks, and Jumbled Pattern Matching. FUN 2010: 89-101 - [c9]Ferdinando Cicalese, Péter L. Erdös, Zsuzsanna Lipták:
Efficient Reconstruction of RC-Equivalent Strings. IWOCA 2010: 349-362
2000 – 2009
- 2009
- [j6]Sebastian Böcker, Matthias C. Letzel, Zsuzsanna Lipták, Anton Pervukhin:
SIRIUS: decomposing isotope patterns for metabolite identification. Bioinform. 25(2): 218-224 (2009) - [c8]Ferdinando Cicalese, Gabriele Fici, Zsuzsanna Lipták:
Searching for Jumbled Patterns in Strings. Stringology 2009: 105-117 - 2008
- [j5]Sebastian Böcker, Zsuzsanna Lipták, Marcel Martin, Anton Pervukhin, Henner Sudek:
DECOMP - from interpreting Mass Spectrometry peaks to solving the Money Changing Problem. Bioinform. 24(4): 591-593 (2008) - [j4]Scott Hazelhurst, Winston Hide, Zsuzsanna Lipták, Ramon Nogueira, Richard Starfield:
An overview of the wcd EST clustering tool. Bioinform. 24(13): 1542-1546 (2008) - 2007
- [j3]Sebastian Böcker, Zsuzsanna Lipták:
A Fast and Simple Algorithm for the Money Changing Problem. Algorithmica 48(4): 413-432 (2007) - [j2]Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták:
Finding submasses in weighted strings with Fast Fourier Transform. Discret. Appl. Math. 155(6-7): 707-718 (2007) - 2006
- [c7]Sebastian Böcker, Matthias C. Letzel, Zsuzsanna Lipták, Anton Pervukhin:
Decomposing Metabolomic Isotope Patterns. WABI 2006: 12-23 - 2005
- [b1]Zsuzsanna Lipták:
Strings in proteomics and transcriptomics : algorithmic and combinatorial questions in mass spectrometry and EST clustering. Bielefeld University, Germany, 2005 - [c6]Sebastian Böcker, Zsuzsanna Lipták:
The Money Changing Problem Revisited: Computing the Frobenius Number in Time O(k a1). COCOON 2005: 965-974 - [c5]Sebastian Böcker, Zsuzsanna Lipták:
Efficient mass decomposition. SAC 2005: 151-157 - 2004
- [j1]Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl:
Algorithmic complexity of protein identification: combinatorics of weighted strings. Discret. Appl. Math. 137(1): 27-46 (2004) - [c4]Judith Zimmermann, Zsuzsanna Lipták, Scott Hazelhurst:
A Method for Evaluating the Quality of String Dissimilarity Measures and Clustering Algorithms for EST Clustering. BIBE 2004: 301-309 - [c3]Nikhil Bansal, Mark Cieliebak, Zsuzsanna Lipták:
Efficient Algorithms for Finding Submasses in Weighted Strings. CPM 2004: 194-204 - 2002
- [c2]Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl:
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS 2002: 143-156 - 2000
- [c1]Zsuzsanna Lipták, A. Nickelsen:
Broadcasting in Complete Networks with Dynamic Edge Faults. OPODIS 2000: 123-142
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:16 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
