Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Solon P. Pissis
2010 – today
- 2013
[j9]Carl Barton, Mathieu Giraud, Costas S. Iliopoulos, Thierry Lecroq, Laurent Mouchard, Solon P. Pissis: Querying highly similar sequences. I. J. Computational Biology and Drug Design 6(1/2): 119-130 (2013)- [j8]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)
- [c19]Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen: Fast Algorithm for Partial Covers in Words. CPM 2013: 177-188
- [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)
- 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)
- [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
- [j2]Oudone Phanalasy, Mirka Miller, Costas S. Iliopoulos, Solon P. Pissis, Elaheh Vaezpour: Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs. Mathematics in Computer Science 5(1): 81-87 (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
- [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)
- 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
2000 – 2009
- 2009
- [j1]Pavlos Antoniou, Costas S. Iliopoulos, Laurent Mouchard, Solon P. Pissis: Algorithms for mapping short degenerate and weighted sequences to a reference genome. I. J. Computational Biology and Drug Design 2(4): 385-397 (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
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-27 22:27 CEST by the dblp team