default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSolon P. Pissis
Person information
- affiliation: Vrije Universiteit, Amsterdam, The Netherlands
- affiliation: CWI, Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j74]Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides
, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching: Theory and Practice. Algorithmica 86(6): 1948-1978 (2024)- [j73]Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering:
On Breaking Truss-based and Core-based Communities. ACM Trans. Knowl. Discov. Data 18(6): 135:1-135:43 (2024) - [j72]Haodi Zhong, Grigorios Loukides, Alessio Conte, Solon P. Pissis:
Ego-Network Segmentation via (Weighted) Jaccard Median. IEEE Trans. Knowl. Data Eng. 36(9): 4646-4663 (2024) - [c107]Giulia Bernardini, Huiping Chen, Inge Li Gørtz, Christoffer Krogh, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Connecting de Bruijn Graphs. CPM 2024: 6:1-6:16 - [c106]Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis:
Minimizing the Minimizers via Alphabet Reordering. CPM 2024: 28:1-28:13 - [c105]Estéban Gabory, Chang Liu, Grigorios Loukides, Solon P. Pissis, Wiktor Zuba:
Space-Efficient Indexes for Uncertain Strings. ICDE 2024: 4828-4842 - [c104]Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis, Hilde Verbeek:
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast. LATIN (1) 2024: 162-177 - [c103]Wiktor Zuba, Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan:
Approximate Suffix-Prefix Dictionary Queries. MFCS 2024: 85:1-85:18 - [c102]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Veronica Guerrini, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis:
Utility-Oriented String Mining. SDM 2024: 190-198 - [c101]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. STACS 2024: 16:1-16:21 - [c100]Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching Under Edit Distance. STACS 2024: 24:1-24:22 - [c99]Philip Bille, Yakov Nekrich, Solon P. Pissis:
Size-Constrained Weighted Ancestors with Applications. SWAT 2024: 14:1-14:12 - [e4]Rezaul Chowdhury, Solon P. Pissis:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2024, Alexandria, VA, USA, January 7-8, 2024. SIAM 2024, ISBN 978-1-61197-792-9 [contents] - [e3]Solon P. Pissis, Wing-Kin Sung:
24th International Workshop on Algorithms in Bioinformatics, WABI 2024, September 2-4, 2024, Royal Holloway, London, United Kingdom. LIPIcs 312, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-340-9 [contents] - [i45]Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching under Edit Distance. CoRR abs/2402.14550 (2024) - [i44]Estéban Gabory, Chang Liu, Grigorios Loukides, Solon P. Pissis, Wiktor Zuba:
Space-Efficient Indexes for Uncertain Strings. CoRR abs/2403.14256 (2024) - [i43]Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis:
Minimizing the Minimizers via Alphabet Reordering. CoRR abs/2405.04052 (2024) - [i42]Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis:
Text Indexing for Long Patterns using Locally Consistent Anchors. CoRR abs/2407.11819 (2024) - 2023
- [j71]Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis:
Text Indexing for Long Patterns: Anchors are All you Need. Proc. VLDB Endow. 16(9): 2117-2131 (2023) - [j70]Mai Alzamel, Christopher Hampson, Costas S. Iliopoulos, Zara Lim, Solon P. Pissis, Dimitrios Vlachakis, Steven Watts:
Maximal degenerate palindromes with gaps and mismatches. Theor. Comput. Sci. 978: 114182 (2023) - [j69]Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering:
Hide and Mine in Strings: Hardness, Algorithms, and Experiments. IEEE Trans. Knowl. Data Eng. 35(6): 5948-5963 (2023) - [j68]Grigorios Loukides, Solon P. Pissis, Michelle Sweering:
Bidirectional String Anchors for Improved Text Indexing and Top-$K$ Similarity Search. IEEE Trans. Knowl. Data Eng. 35(11): 11093-11111 (2023) - [c98]Estéban Gabory, Njagi Moses Mwaniki, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski, Michelle Sweering, Wiktor Zuba:
Comparing Elastic-Degenerate Strings: Algorithms, Lower Bounds, and Applications. CPM 2023: 11:1-11:20 - [c97]Grigorios Loukides, Solon P. Pissis, Sharma V. Thankachan, Wiktor Zuba:
Suffix-Prefix Queries on a Dictionary. CPM 2023: 21:1-21:20 - [c96]Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. ISAAC 2023: 12:1-12:19 - [c95]Huiping Chen, Grigorios Loukides, Robert Gwadera, Solon P. Pissis:
Heavy Nodes in a Small Neighborhood: Algorithms and Applications. SDM 2023: 307-315 - [c94]Solon P. Pissis, Michael Shekelyan, Chang Liu, Grigorios Loukides:
Frequency-Constrained Substring Complexity. SPIRE 2023: 345-352 - [i41]Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis, Hilde Verbeek:
Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast. CoRR abs/2310.09023 (2023) - [i40]Philip Bille, Yakov Nekrich, Solon P. Pissis:
Size-constrained Weighted Ancestors with Applications. CoRR abs/2311.15777 (2023) - 2022
- [j67]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. Algorithmica 84(5): 1418-1440 (2022) - [j66]Haodi Zhong, Grigorios Loukides, Solon P. Pissis:
Clustering sequence graphs. Data Knowl. Eng. 138: 101981 (2022) - [j65]Grigorios Loukides, Solon P. Pissis:
All-pairs suffix/prefix in optimal time using Aho-Corasick space. Inf. Process. Lett. 178: 106275 (2022) - [j64]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Elastic-Degenerate String Matching via Fast Matrix Multiplication. SIAM J. Comput. 51(3): 549-576 (2022) - [j63]Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis:
Internal shortest absent word queries in constant time and linear space. Theor. Comput. Sci. 922: 271-282 (2022) - [j62]Haodi Zhong, Grigorios Loukides, Solon P. Pissis:
Clustering Demographics and Sequences of Diagnosis Codes. IEEE J. Biomed. Health Informatics 26(5): 2351-2359 (2022) - [j61]Marco Virgolin, Solon P. Pissis:
Symbolic Regression is NP-hard. Trans. Mach. Learn. Res. 2022 (2022) - [c93]Giulia Bernardini, Huiping Chen, Grigorios Loukides, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Making de Bruijn Graphs Eulerian. CPM 2022: 12:1-12:18 - [c92]Giulia Bernardini, Alessio Conte, Estéban Gabory, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Giulia Punzi, Michelle Sweering:
On Strings Having the Same Length- k Substrings. CPM 2022: 16:1-16:17 - [c91]Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Palindromic Substring in Sublinear Time. CPM 2022: 20:1-20:9 - [c90]Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. ESA 2022: 35:1-35:19 - [c89]Haodi Zhong, Grigorios Loukides, Alessio Conte, Solon P. Pissis:
Jaccard Median for Ego-network Segmentation. ICDM 2022: 1353-1358 - [c88]Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba:
Elastic-Degenerate String Matching with 1 Error. LATIN 2022: 20-37 - [c87]Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Subsequence Covers of Words. SPIRE 2022: 3-15 - [i39]Marco Virgolin, Solon P. Pissis:
Symbolic Regression is NP-hard. CoRR abs/2207.01018 (2022) - [i38]Panagiotis Charalampopoulos, Tomasz Kociumaka, Jakub Radoszewski, Solon P. Pissis, Wojciech Rytter, Tomasz Walen, Wiktor Zuba:
Approximate Circular Pattern Matching. CoRR abs/2208.08915 (2022) - [i37]Giulia Bernardini, Estéban Gabory, Solon P. Pissis, Leen Stougie, Michelle Sweering, Wiktor Zuba:
Elastic-Degenerate String Matching with 1 Error. CoRR abs/2209.01095 (2022) - [i36]Philip Bille, Inge Li Gørtz, Moshe Lewenstein, Solon P. Pissis, Eva Rotenberg, Teresa Anna Steiner:
Gapped String Indexing in Subquadratic Space and Sublinear Query Time. CoRR abs/2211.16860 (2022) - 2021
- [j60]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts:
IUPACpal: efficient identification of inverted repeats in IUPAC-encoded DNA sequences. BMC Bioinform. 22(1): 51 (2021) - [j59]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient pattern matching in elastic-degenerate strings. Inf. Comput. 279: 104616 (2021) - [j58]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular pattern matching with k mismatches. J. Comput. Syst. Sci. 115: 73-85 (2021) - [j57]Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis:
Reverse-Safe Text Indexing. ACM J. Exp. Algorithmics 26: 1.10:1-1.10:26 (2021) - [j56]Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis:
Constructing Antidictionaries of Long Texts in Output-Sensitive Space. Theory Comput. Syst. 65(5): 777-797 (2021) - [j55]Huiping Chen, Grigorios Loukides, Solon P. Pissis, Hau Chan:
Influence maximization in the presence of vulnerable nodes: A ratio perspective. Theor. Comput. Sci. 852: 84-103 (2021) - [j54]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone, Michelle Sweering:
Combinatorial Algorithms for String Sanitization. ACM Trans. Knowl. Discov. Data 15(1): 8:1-8:34 (2021) - [c86]Golnaz Badkobeh, Panagiotis Charalampopoulos, Solon P. Pissis:
Internal Shortest Absent Word Queries. CPM 2021: 6:1-6:18 - [c85]Giulia Bernardini, Alberto Marchetti-Spaccamela, Solon P. Pissis, Leen Stougie, Michelle Sweering:
Constructing Strings Avoiding Forbidden Substrings. CPM 2021: 9:1-9:18 - [c84]Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance: Improved and Generalized. CPM 2021: 19:1-19:18 - [c83]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. ESA 2021: 30:1-30:17 - [c82]Grigorios Loukides, Solon P. Pissis:
Bidirectional String Anchors: A New String Sampling Mechanism. ESA 2021: 64:1-64:21 - [c81]Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi:
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails. FCT 2021: 162-175 - [c80]Huiping Chen, Changyu Dong, Liyue Fan, Grigorios Loukides, Solon P. Pissis, Leen Stougie:
Differentially Private String Sanitization for Frequency-Based Mining Tasks. ICDM 2021: 41-50 - [c79]Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching. ISAAC 2021: 65:1-65:19 - [c78]Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Solon P. Pissis, Michelle Sweering:
On Breaking Truss-Based Communities. KDD 2021: 117-126 - [i35]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Faster Algorithms for Longest Common Substring. CoRR abs/2105.03106 (2021) - [i34]Golnaz Badkobeh, Panagiotis Charalampopoulos, Dmitry Kosolobov, Solon P. Pissis:
Internal Shortest Absent Word Queries in Constant Time and Linear Space. CoRR abs/2106.01763 (2021) - [i33]Grigorios Loukides, Solon P. Pissis, Michelle Sweering:
String Sampling with Bidirectional String Anchors. CoRR abs/2112.10376 (2021) - 2020
- [j53]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Dynamic and Internal Longest Common Substring. Algorithmica 82(12): 3707-3743 (2020) - [j52]Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan:
Efficient Data Structures for Range Shortest Unique Substring Queries. Algorithms 13(11): 276 (2020) - [j51]Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Solon P. Pissis:
SMART: SuperMaximal approximate repeats tool. Bioinform. 36(8): 2589-2591 (2020) - [j50]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Comparing Degenerate Strings. Fundam. Informaticae 175(1-4): 41-58 (2020) - [j49]Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski:
Indexing weighted sequences: Neat and efficient. Inf. Comput. 270 (2020) - [j48]Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat:
Absent words in a sliding window with applications. Inf. Comput. 270 (2020) - [j47]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Wing-Kin Sung, Steven Watts:
Efficient Identification of k-Closed Strings. Int. J. Found. Comput. Sci. 31(5): 595-610 (2020) - [j46]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Property Suffix Array with Applications in Indexing Weighted Sequences. ACM J. Exp. Algorithmics 25: 1-16 (2020) - [j45]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. Theor. Comput. Sci. 812: 2-12 (2020) - [j44]Giulia Bernardini, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Approximate pattern matching on elastic-degenerate text. Theor. Comput. Sci. 812: 109-122 (2020) - [j43]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest property-preserved common factor: A new string-processing framework. Theor. Comput. Sci. 812: 244-251 (2020) - [c77]Giulia Bernardini, Huiping Chen, Gabriele Fici, Grigorios Loukides, Solon P. Pissis:
Reverse-Safe Data Structures for Text Indexing. ALENEX 2020: 199-213 - [c76]Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Solon P. Pissis:
SMART: SuperMaximal approximate repeats tool. BCB 2020: 17:1 - [c75]Giulia Bernardini, Huiping Chen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance. CPM 2020: 7:1-7:14 - [c74]Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Tomasz Walen, Wiktor Zuba:
Unary Words Have the Smallest Levenshtein k-Neighbourhoods. CPM 2020: 10:1-10:12 - [c73]Giulia Bernardini, Alessio Conte, Garance Gourdel, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giulia Punzi, Leen Stougie, Michelle Sweering:
Hide and Mine in Strings: Hardness and Algorithms. ICDM 2020: 924-929 - [i32]Panagiotis Charalampopoulos, Huiping Chen, Peter Christen, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Jakub Radoszewski:
Pattern Masking for Dictionary Matching. CoRR abs/2006.16137 (2020) - [i31]Takuya Mieno, Solon P. Pissis, Leen Stougie, Michelle Sweering:
String Sanitization Under Edit Distance: Improved and Generalized. CoRR abs/2007.08179 (2020) - [i30]Giulia Bernardini, Gabriele Fici, Pawel Gawrychowski, Solon P. Pissis:
Substring Complexity in Sublinear Space. CoRR abs/2007.08357 (2020)
2010 – 2019
- 2019
- [j42]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
On-line weighted pattern matching. Inf. Comput. 266: 49-59 (2019) - [j41]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient enumeration of non-equivalent squares in partial words with few holes. J. Comb. Optim. 37(2): 501-522 (2019) - [j40]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. Theory Comput. Syst. 63(3): 506-542 (2019) - [j39]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
On overabundant words and their application to biological sequence analysis. Theor. Comput. Sci. 792: 85-95 (2019) - [c72]Arnab Ganguly, Wing-Kai Hon, Yu-An Huang, Solon P. Pissis, Rahul Shah, Sharma V. Thankachan:
Parameterized Text Indexing with One Wildcard. DCC 2019: 152-161 - [c71]Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis:
Constructing Antidictionaries in Output-Sensitive Space. DCC 2019: 538-547 - [c70]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Substring Made Fully Dynamic. ESA 2019: 6:1-6:17 - [c69]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. FCT 2019: 213-228 - [c68]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. ICALP 2019: 21:1-21:15 - [c67]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
String Sanitization: A Combinatorial Approach. ECML/PKDD (1) 2019: 627-644 - [c66]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. SPIRE 2019: 221-238 - [c65]Paniz Abedin, Arnab Ganguly, Solon P. Pissis, Sharma V. Thankachan:
Range Shortest Unique Substring Queries. SPIRE 2019: 258-266 - [e2]Nadia Pisanti, Solon P. Pissis:
30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, June 18-20, 2019, Pisa, Italy. LIPIcs 128, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-103-0 [contents] - [i29]Lorraine A. K. Ayad, Golnaz Badkobeh, Gabriele Fici, Alice Héliou, Solon P. Pissis:
Constructing Antidictionaries in Output-Sensitive Space. CoRR abs/1902.04785 (2019) - [i28]Giulia Bernardini, Pawel Gawrychowski, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Even Faster Elastic-Degenerate String Matching via Fast Matrix Multiplication. CoRR abs/1905.02298 (2019) - [i27]Giulia Bernardini, Huiping Chen, Alessio Conte, Roberto Grossi, Grigorios Loukides, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
String Sanitization: A Combinatorial Approach. CoRR abs/1906.11030 (2019) - [i26]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Circular Pattern Matching with k Mismatches. CoRR abs/1907.01815 (2019) - [i25]Panagiotis Charalampopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Weighted Shortest Common Supersequence Problem Revisited. CoRR abs/1909.11433 (2019) - 2018
- [j38]Carl Barton, Solon P. Pissis:
Crochemore's Partitioning on Weighted Strings and Applications. Algorithmica 80(2): 496-514 (2018) - [j37]João A. Carriço, Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Bruno Ribeiro-Gonçalves, Cátia Vaz:
Fast phylogenetic inference from typing data. Algorithms Mol. Biol. 13(1): 4:1-4:14 (2018) - [j36]Lorraine A. K. Ayad, Solon P. Pissis, Dimitris Polychronopoulos:
CNEFinder: finding conserved non-coding elements in genomes. Bioinform. 34(17): i743-i747 (2018) - [j35]Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis:
Preface. Fundam. Informaticae 163(3): i (2018) - [j34]Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. Inf. Comput. 262: 57-68 (2018) - [j33]Carl Barton, Chang Liu, Solon P. Pissis:
Fast Average-Case Pattern Matching on Weighted Sequences. Int. J. Found. Comput. Sci. 29(8): 1331-1343 (2018) - [j32]Maxime Crochemore, Solon P. Pissis:
Advances in Algorithms & Combinatorics on Strings (Honoring 60th birthday for Prof. Costas S. Iliopoulos). Theor. Comput. Sci. 710: 1 (2018) - [j31]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient algorithms for shortest partial seeds in words. Theor. Comput. Sci. 710: 139-147 (2018) - [c64]Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Linear-Time Algorithm for Long LCF with k Mismatches. CPM 2018: 23:1-23:16 - [c63]Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis:
Longest Unbordered Factor in Quasilinear Time. ISAAC 2018: 70:1-70:13 - [c62]Panagiotis Charalampopoulos, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Property Suffix Array with Applications. LATIN 2018: 290-302 - [c61]Hayam Alamro, Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Mismatches and Applications. SOFSEM 2018: 636-649 - [c60]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. SPIRE 2018: 12-26 - [c59]Lorraine A. K. Ayad, Carl Barton, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Errors and Applications. SPIRE 2018: 27-41 - [c58]