Stop the war!Остановите войну!
for scientists:
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
Journal Articles
- 2024
[j73]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)- [j72]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) - 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) - 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) - 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) - 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) - 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) - 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) - 2017
- [j30]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
On avoided words, absent words, and their application to biological sequence analysis. Algorithms Mol. Biol. 12(1): 5:1-5:12 (2017) - [j29]Alice Héliou, Solon P. Pissis, Simon J. Puglisi:
emMAW: computing minimal absent words in external memory. Bioinform. 33(17): 2746-2749 (2017) - [j28]Tanver Athar, Carl Barton, Widmer Bland, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Fast circular dictionary-matching algorithm. Math. Struct. Comput. Sci. 27(2): 143-156 (2017) - [j27]Lorraine A. K. Ayad, Carl Barton, Solon P. Pissis:
A faster and more accurate heuristic for cyclic edit distance computation. Pattern Recognit. Lett. 88: 81-87 (2017) - 2016
- [j26]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 12 (2016) - [j25]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Erratum to: Circular sequence comparison: algorithms and applications. Algorithms Mol. Biol. 11: 21 (2016) - [j24]Lorraine A. K. Ayad, Solon P. Pissis, Ahmad Retha:
libFLASM: a software library for fixed-length approximate string matching. BMC Bioinform. 17: 454:1-454:12 (2016) - [j23]Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Linear-time superbubble identification algorithm for genome assembly. Theor. Comput. Sci. 609: 374-383 (2016) - [j22]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-preserving indexing. Theor. Comput. Sci. 638: 122-135 (2016) - [j21]Carl Barton, Chang Liu, Solon P. Pissis:
Linear-time computation of prefix table for weighted strings & applications. Theor. Comput. Sci. 656: 160-172 (2016) - 2015
- [j20]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. Algorithmica 73(1): 217-233 (2015) - [j19]Hideo Bannai, Solon P. Pissis:
Editorial. J. Discrete Algorithms 34: 1 (2015) - [j18]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
Global and local sequence alignment with a bounded number of gaps. Theor. Comput. Sci. 582: 1-16 (2015) - 2014
- [j17]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Fast algorithms for approximate circular string matching. Algorithms Mol. Biol. 9: 9 (2014) - [j16]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Optimal computation of all tandem repeats in a weighted sequence. Algorithms Mol. Biol. 9: 21 (2014) - [j15]Solon P. Pissis:
MoTeX-II: structured MoTif eXtraction from large-scale datasets. BMC Bioinform. 15: 235 (2014) - [j14]Carl Barton, Alice Héliou, Laurent Mouchard, Solon P. Pissis:
Linear-time computation of minimal absent words using suffix array. BMC Bioinform. 15: 388 (2014) - [j13]Carl Barton, Costas S. Iliopoulos, Inbok Lee, Laurent Mouchard, Kunsoo Park, Solon P. Pissis:
Extending alignments with k-mismatches and ℓ-gaps. Theor. Comput. Sci. 525: 80-88 (2014) - 2013
- [j12]Nikolaos Alachiotis, Simon A. Berger, Tomás Flouri, Solon P. Pissis, Alexandros Stamatakis:
libgapmis: extending short-read alignments. BMC Bioinform. 14(S-11): S4 (2013) - [j11]Carl Barton, Mathieu Giraud, Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Solon P. Pissis:
Querying highly similar sequences. Int. J. Comput. Biol. Drug Des. 6(1/2): 119-130 (2013) - [j10]Michalis Christou, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis, Jan Zdárek:
Tree template matching in unranked ordered trees. J. Discrete Algorithms 20: 51-60 (2013) - [j9]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient seed computation revisited. Theor. Comput. Sci. 483: 171-181 (2013) - [j8]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, W. F. Smyth, Wojciech Tyczynski:
Enhanced string covering. Theor. Comput. Sci. 506: 102-114 (2013) - 2012
- [j7]Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis:
Parallel Algorithms for Mapping Short degenerate and Weighted DNA Sequences to a Reference genome. Int. J. Found. Comput. Sci. 23(2): 249-259 (2012) - [j6]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing all subtree repeats in ordered trees. Inf. Process. Lett. 112(24): 958-962 (2012) - [j5]Costas S. Iliopoulos, Derrick G. Kourie, Laurent Mouchard, Themba K. Musombuka, Solon P. Pissis, Corné de Ridder:
An algorithm for mapping short reads to a dynamically changing genomic sequence. J. Discrete Algorithms 10: 15-22 (2012) - [j4]Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Tree template matching in ranked ordered trees by pushdown automata. J. Discrete Algorithms 17: 15-23 (2012) - [j3]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On left and right seeds of a string. J. Discrete Algorithms 17: 31-44 (2012) - 2011
- [j2]Oudone Phanalasy, Mirka Miller, Costas S. Iliopoulos, Solon P. Pissis, Elaheh Vaezpour:
Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs. Math. Comput. Sci. 5(1): 81-87 (2011) - 2009
- [j1]Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
Algorithms for mapping short degenerate and weighted sequences to a reference genome. Int. J. Comput. Biol. Drug Des. 2(4): 385-397 (2009)
Conference and Workshop Papers
- 2024
- [c102]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 - [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 - 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 - 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 - 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 - 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 - 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 - 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]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. SPIRE 2018: 42-49 - [c57]Panagiotis Charalampopoulos, Maxime Crochemore, Solon P. Pissis:
On Extended Special Factors of a Word. SPIRE 2018: 131-138 - [c56]Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Maximal Motif Discovery in a Sliding Window. SPIRE 2018: 191-205 - [c55]Mai Alzamel, Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Degenerate String Comparison and Applications. WABI 2018: 21:1-21:14 - [c54]Solon P. Pissis, Ahmad Retha:
Dictionary Matching in Elastic-Degenerate Texts with Applications in Searching VCF Files On-line. SEA 2018: 16:1-16:14 - 2017
- [c53]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster Algorithms for 1-Mappability of a Sequence. COCOA (2) 2017: 109-121 - [c52]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. COCOON 2017: 99-111 - [c51]Roberto Grossi, Costas S. Iliopoulos, Chang Liu, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Giovanna Rosone, Fatima Vayani, Luca Versari:
On-Line Pattern Matching on Similar Texts. CPM 2017: 9:1-9:14 - [c50]Hayam Alamro, Mai Alzamel, Costas S. Iliopoulos, Solon P. Pissis, Steven Watts, Wing-Kin Sung:
Efficient Identification of k-Closed Strings. EANN 2017: 583-595 - [c49]Mai Alzamel, Jia Gao, Costas S. Iliopoulos, Chang Liu, Solon P. Pissis:
Efficient Computation of Palindromes in Sequences with Uncertainties. EANN 2017: 620-629 - [c48]Maxime Crochemore, Alice Héliou, Gregory Kucherov, Laurent Mouchard, Solon P. Pissis, Yann Ramusat:
Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching. FCT 2017: 164-176 - [c47]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to Answer a Small Batch of RMQs or LCA Queries in Practice. IWOCA 2017: 343-355 - [c46]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient Pattern Matching in Elastic-Degenerate Texts. LATA 2017: 131-142 - [c45]Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor After One Edit Operation. SPIRE 2017: 14-26 - [c44]Giulia Bernardini, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Pattern Matching on Elastic-Degenerate Text with Errors. SPIRE 2017: 74-90 - [c43]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Overabundant Words. WABI 2017: 4:1-4:14 - [c42]Maxime Crochemore, Alexandre P. Francisco, Solon P. Pissis, Cátia Vaz:
Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time. WABI 2017: 9:1-9:14 - 2016
- [c41]Carl Barton, Chang Liu, Solon P. Pissis:
On-Line Pattern Matching on Uncertain Sequences and Applications. COCOA 2016: 547-562 - [c40]Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Efficient Index for Weighted Sequences. CPM 2016: 4:1-4:13 - [c39]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Pattern Matching and Consensus Problems on Weighted Sequences and Profiles. ISAAC 2016: 46:1-46:12 - [c38]Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. LATIN 2016: 334-346 - [c37]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. SPIRE 2016: 22-34 - [c36]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Avoided Words. WABI 2016: 1-13 - 2015
- [c35]Carl Barton, Solon P. Pissis:
Linear-Time Computation of Prefix Table for Weighted Strings. WORDS 2015: 73-84 - [c34]Solon P. Pissis, Ahmad Retha:
Generalised Implementation for Fixed-Length Approximate String Matching under Hamming Distance and Applications. IPDPS Workshops 2015: 367-374 - [c33]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. LATA 2015: 85-96 - [c32]Carl Barton, Alice Héliou, Laurent Mouchard, Solon P. Pissis:
Parallelising the Computation of Minimal Absent Words. PPAM (2) 2015: 243-253 - [c31]Roberto Grossi, Costas S. Iliopoulos, Robert Mercas, Nadia Pisanti, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Circular Sequence Comparison with q-grams. WABI 2015: 203-216 - [c30]Carl Barton, Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis, Ahmad Retha, Fatima Vayani:
Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment. SEA 2015: 247-258 - 2014
- [c29]Vida Ghanaei, Costas S. Iliopoulos, Solon P. Pissis:
Detection of Web Spambot in the Presence of Decoy Actions. BDCloud 2014: 277-279 - [c28]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Efficient Algorithms for Shortest Partial Seeds in Words. CPM 2014: 192-201 - [c27]Carl Barton, Solon P. Pissis:
Optimal Computation of all Repetitions in a Weighted String. ICABD 2014: 9-15 - [c26]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis, William F. Smyth:
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance. IWOCA 2014: 49-61 - 2013
- [c25]Solon P. Pissis, Alexandros Stamatakis, Pavlos Pavlidis:
MoTeX: A word-based HPC tool for MoTif eXtraction. BCB 2013: 13 - [c24]Carl Barton, Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
GapsMis: flexible sequence alignment with a bounded number of gaps. BCB 2013: 402 - [c23]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CPM 2013: 177-188 - [c22]Fernando Izquierdo-Carrasco, Nikolaos Alachiotis, Simon A. Berger, Tomás Flouri, Solon P. Pissis, Alexandros Stamatakis:
A Generic Vectorization Scheme and a GPU Kernel for the Phylogenetic Likelihood Library. IPDPS Workshops 2013: 530-538 - [c21]Tomás Flouri, Kassian Kobert, Solon P. Pissis, Alexandros Stamatakis:
An Optimal Algorithm for Computing All Subtree Repeats in Trees. IWOCA 2013: 269-282 - [c20]Solon P. Pissis, Christian Goll, Pavlos Pavlidis, Alexandros Stamatakis:
Accelerating String Matching on MIC Architecture for Motif Extraction. PPAM (2) 2013: 258-267 - [c19]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes. SPIRE 2013: 84-95 - 2012
- [c18]Nikolaos Alachiotis, Simon A. Berger, Tomás Flouri, Solon P. Pissis, Alexandros Stamatakis:
Libgapmis: An ultrafast library for short-read single-gap alignment. BIBM Workshops 2012: 688-695 - [c17]Mourad Elloumi, Pedram Hayati, Costas S. Iliopoulos, Solon P. Pissis, Arfaat Shah:
Detection of fixed length web spambot using REAL (read aligner). CUBE 2012: 820-825 - [c16]Tomás Flouri, Costas S. Iliopoulos, Kunsoo Park, Solon P. Pissis:
GapMis-OMP: Pairwise Short-Read Alignment on Multi-core Architectures. AIAI (2) 2012: 593-601 - [c15]Tomás Flouri, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Simon J. Puglisi, William F. Smyth, Wojciech Tyczynski:
New and Efficient Approaches to the Quasiperiodic Characterisation of a String. Stringology 2012: 75-88 - 2011
- [c14]Tomás Flouri, Costas S. Iliopoulos, Solon P. Pissis:
DynMap: mapping short reads to multiple related genomes. BCB 2011: 330-334 - [c13]Tomás Flouri, Kunsoo Park, Kimon Frousios, Solon P. Pissis, Costas S. Iliopoulos, German Tischler:
Approximate string-matching with a single gap for sequence alignment. BCB 2011: 490-492 - [c12]Michalis Christou, Maxime Crochemore, Ondrej Guth, Costas S. Iliopoulos, Solon P. Pissis:
On the Right-Seed Array of a String. COCOON 2011: 492-502 - [c11]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CPM 2011: 350-363 - [c10]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Indexing by Pushdown Automata and Repeats of Subtrees. FedCSIS 2011: 899-902 - [c9]Michalis Christou, Maxime Crochemore, Tomás Flouri, Costas S. Iliopoulos, Jan Janousek, Borivoj Melichar, Solon P. Pissis:
Computing All Subtree Repeats in Ordered Ranked Trees. SPIRE 2011: 338-343 - [c8]Tomás Flouri, Jan Janousek, Borivoj Melichar, Costas S. Iliopoulos, Solon P. Pissis:
Tree Template Matching in Ranked Ordered Trees by Pushdown Automata. CIAA 2011: 273-281 - 2010
- [c7]Kimon Frousios, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis, German Tischler:
REAL: an efficient REad ALigner for next generation sequencing reads. BCB 2010: 154-159 - [c6]Tomás Flouri, Jan Holub, Costas S. Iliopoulos, Solon P. Pissis:
An algorithm for mapping short reads to a dynamically changing genomic sequence. BIBM 2010: 133-136 - [c5]Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis:
A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. Algorithms and Applications 2010: 92-101 - [c4]Maxime Crochemore, Costas S. Iliopoulos, Solon P. Pissis, German Tischler:
Cover Array String Reconstruction. CPM 2010: 251-259 - 2009
- [c3]Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. IJCBS 2009: 174-180 - [c2]Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis:
A Parallel Algorithm for the Fixed-length Approximate String Matching Problem for High Throughput Sequencing Technologies. PARCO 2009: 150-157 - [c1]Costas S. Iliopoulos, Mirka Miller, Solon P. Pissis:
Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. Stringology 2009: 249-262
Parts in Books or Collections
- 2017
- [p1]Costas S. Iliopoulos, Solon P. Pissis, M. Sohel Rahman:
Searching and Indexing Circular Patterns. Algorithms for Next-Generation Sequencing Data 2017: 77-90
Editorship
- 2019
- [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] - 2017
- [e1]Costas S. Iliopoulos, Solon P. Pissis, Simon J. Puglisi, Rajeev Raman:
16th International Symposium on Experimental Algorithms, SEA 2017, June 21-23, 2017, London, UK. LIPIcs 75, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-036-1 [contents]
Informal and Other Publications
- 2024
- [i44]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) - [i43]Estéban Gabory, Chang Liu, Grigorios Loukides, Solon P. Pissis, Wiktor Zuba:
Space-Efficient Indexes for Uncertain Strings. CoRR abs/2403.14256 (2024) - [i42]Hilde Verbeek, Lorraine A. K. Ayad, Grigorios Loukides, Solon P. Pissis:
Minimizing the Minimizers via Alphabet Reordering. CoRR abs/2405.04052 (2024) - 2023
- [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
- [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
- [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
- [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) - 2019
- [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
- [i24]Lorraine A. K. Ayad, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
Longest Common Prefixes with k-Errors and Applications. CoRR abs/1801.04425 (2018) - [i23]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. CoRR abs/1802.06369 (2018) - [i22]Amihood Amir, Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski:
Longest Common Factor Made Fully Dynamic. CoRR abs/1804.08731 (2018) - [i21]Tomasz Kociumaka, Ritu Kundu, Manal Mohamed, Solon P. Pissis:
Longest Unbordered Factor in Quasilinear Time. CoRR abs/1805.09924 (2018) - [i20]Panagiotis Charalampopoulos, Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Alignment-free sequence comparison using absent words. CoRR abs/1806.02718 (2018) - [i19]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Juliusz Straszynski:
Efficient Computation of Sequence Mappability. CoRR abs/1807.11702 (2018) - [i18]Lorraine A. K. Ayad, Giulia Bernardini, Roberto Grossi, Costas S. Iliopoulos, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone:
Longest Property-Preserved Common Factor. CoRR abs/1810.02099 (2018) - 2017
- [i17]Carl Barton, Tomasz Kociumaka, Chang Liu, Solon P. Pissis, Jakub Radoszewski:
Indexing Weighted Sequences: Neat and Efficient. CoRR abs/1704.07625 (2017) - [i16]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Overabundant Words. CoRR abs/1705.03385 (2017) - [i15]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski, Wing-Kin Sung:
Faster algorithms for 1-mappability of a sequence. CoRR abs/1705.04022 (2017) - [i14]Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis:
How to answer a small batch of RMQs or LCA queries in practice. CoRR abs/1705.04589 (2017) - 2016
- [i13]Carl Barton, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Efficient Index for Weighted Sequences. CoRR abs/1602.01116 (2016) - [i12]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski:
Parameterizing PWM- and Profile-Matching and Knapsack by the feasible-weight solutions count. CoRR abs/1604.07581 (2016) - [i11]Yannis Almirantis, Panagiotis Charalampopoulos, Jia Gao, Costas S. Iliopoulos, Manal Mohamed, Solon P. Pissis, Dimitris Polychronopoulos:
Optimal Computation of Avoided Words. CoRR abs/1604.08760 (2016) - [i10]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Ritu Kundu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries. CoRR abs/1606.08275 (2016) - [i9]Costas S. Iliopoulos, Ritu Kundu, Solon P. Pissis:
Efficient Pattern Matching in Elastic-Degenerate Strings. CoRR abs/1610.08111 (2016) - 2015
- [i8]Ljiljana Brankovic, Costas S. Iliopoulos, Ritu Kundu, Manal Mohamed, Solon P. Pissis, Fatima Vayani:
Linear-Time Superbubble Identification Algorithm. CoRR abs/1505.04019 (2015) - [i7]Maxime Crochemore, Gabriele Fici, Robert Mercas, Solon P. Pissis:
Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. CoRR abs/1506.04917 (2015) - [i6]Carl Barton, Chang Liu, Solon P. Pissis:
Fast Average-Case Pattern Matching on Weighted Sequences. CoRR abs/1512.01085 (2015) - 2014
- [i5]Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Solon P. Pissis, Tomasz Walen:
Fast Algorithm for Partial Covers in Words. CoRR abs/1401.0163 (2014) - [i4]Carl Barton, Costas S. Iliopoulos, Solon P. Pissis:
Average-Case Optimal Approximate Circular String Matching. CoRR abs/1406.5480 (2014) - [i3]Carl Barton, Alice Héliou, Laurent Mouchard, Solon P. Pissis:
Linear-time Computation of Minimal Absent Words Using Suffix Array. CoRR abs/1406.6341 (2014) - 2013
- [i2]Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Marcin Kubica, Alessio Langiu, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen:
Order-Preserving Suffix Trees and Their Algorithmic Applications. CoRR abs/1303.6872 (2013) - 2011
- [i1]Michalis Christou, Maxime Crochemore, Costas S. Iliopoulos, Marcin Kubica, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Bartosz Szreder, Tomasz Walen:
Efficient Seeds Computation Revisited. CoRR abs/1104.3153 (2011)
Coauthor Index
Mai Abdulaziz Alzamel
aka: Mai Alzamel
aka: Mai Alzamel
[j73] [j67] [j63] [j58] [j53] [j51] [j46] [j45] [j42] [j41] [j39] [j35] [j34] [j30] [c100] [c91] [c90] [c87] [c86] [c83] [c79] [c76] [c74] [c70] [c69] [c66] [c64] [c62] [c61] [c60] [c59] [c57] [c53] [c52] [c47] [c45] [c43] [c36] [i44] [i38] [i35] [i34] [i32] [i26] [i25] [i24] [i23] [i22] [i20] [i19] [i16] [i15] [i14] [i11]
[j70] [j67] [j60] [j59] [j50] [j47] [j46] [j45] [j43] [j42] [j41] [j39] [j30] [j28] [j26] [j25] [j23] [j22] [j18] [j17] [j16] [j13] [j11] [j10] [j9] [j8] [j7] [j6] [j5] [j4] [j3] [j2] [j1] [c64] [c62] [c61] [c60] [c59] [c58] [c56] [c55] [c53] [c52] [c51] [c50] [c49] [c47] [c46] [c45] [c43] [c37] [c36] [c33] [c31] [c30] [c29] [c26] [c24] [c19] [c17] [c16] [c15] [c14] [c13] [c12] [c11] [c10] [c9] [c8] [c7] [c6] [c5] [c4] [c3] [c2] [c1] [p1] [e1] [i24] [i23] [i19] [i18] [i16] [i15] [i14] [i11] [i10] [i9] [i8] [i4] [i2] [i1]
[j73] [j67] [j58] [j53] [j49] [j45] [j42] [j41] [j40] [j31] [j22] [j20] [j9] [c100] [c98] [c91] [c90] [c87] [c83] [c79] [c74] [c70] [c69] [c66] [c64] [c60] [c53] [c52] [c45] [c40] [c39] [c37] [c28] [c23] [c19] [c11] [i44] [i38] [i35] [i32] [i26] [i25] [i23] [i22] [i19] [i17] [i15] [i13] [i12] [i10] [i5] [i2] [i1]
a service of 
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 2024-06-10 23:27 CEST 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:
