The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Costas S. Iliopoulos: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Qing Guo, Hui Zhang, Costas S. Iliopoulos
    Computing the lambda-Seeds of a String. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:303-313 [Conf]
  2. Hui Zhang, Qing Guo, Costas S. Iliopoulos
    String Matching with Swaps in a Weighted Sequence. [Citation Graph (0, 0)][DBLP]
    CIS, 2004, pp:698-704 [Conf]
  3. M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, Manal Mohamed, William F. Smyth
    Finding Patterns with Variable Length Gaps or Don't Cares. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:146-155 [Conf]
  4. Amihood Amir, Eran Chencinski, Costas S. Iliopoulos, Tsvi Kopelowitz, Hui Zhang
    Property Matching and Weighted Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:188-199 [Conf]
  5. Amihood Amir, Costas S. Iliopoulos, Oren Kapah, Ely Porat
    Approximate Matching in Weighted Sequences. [Citation Graph (0, 0)][DBLP]
    CPM, 2006, pp:365-376 [Conf]
  6. Peter Clifford, Raphaël Clifford, Costas S. Iliopoulos
    Faster Algorithms for delta, gamma-Matching and Related Problems. [Citation Graph (0, 0)][DBLP]
    CPM, 2005, pp:68-78 [Conf]
  7. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    Three Heuristics for delta-Matching: delta-BM Algorithms. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:178-189 [Conf]
  8. Costas S. Iliopoulos, Dennis Moore, Kunsoo Park
    Covering a String. [Citation Graph (0, 0)][DBLP]
    CPM, 1993, pp:54-62 [Conf]
  9. Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Athanasios K. Tsakalidis, Kostas Tsichlas
    Identifying Occurrences of Maximal Pairs in Multiple Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:133-143 [Conf]
  10. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
    Approximate Periods of Strings. [Citation Graph (0, 0)][DBLP]
    CPM, 1999, pp:123-133 [Conf]
  11. Costas S. Iliopoulos
    Worst-Case Analysis of Algorithms for Computational Problems on Abelian Permutation Groups. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:225-228 [Conf]
  12. Costas S. Iliopoulos
    Gaussian Elimination over a Euclidean Ring. [Citation Graph (0, 0)][DBLP]
    European Conference on Computer Algebra (2), 1985, pp:29-30 [Conf]
  13. Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis
    Efficient Algorithms for Handling Molecular Weighted Sequences. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2004, pp:265-278 [Conf]
  14. M. Sohel Rahman, Costas S. Iliopoulos
    Algorithms for Computing Variants of the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2006, pp:399-408 [Conf]
  15. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    A Pattern Extraction Algorithm for Abstract Melodic Representations that Allow Partial Overlapping of Intervallic Categories. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2005, pp:167-174 [Conf]
  16. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Finding Motifs with Gaps. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2000, pp:- [Conf]
  17. Jeremy Pickens, Costas S. Iliopoulos
    Markov Random Fields and Maximum Entropy Modeling for Music Information Retrieval. [Citation Graph (0, 0)][DBLP]
    ISMIR, 2005, pp:207-214 [Conf]
  18. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    Longest Repeats with a Block of Don't Cares. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:271-278 [Conf]
  19. Costas S. Iliopoulos, William F. Smyth
    PRAM Algorithms for Identifying Polygon Similarity. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:25-32 [Conf]
  20. Alberto Apostolico, Costas S. Iliopoulos, Robert Paige
    On O(n log n) Cost Parallel Algorithm for the Single Function Coarsest Partition Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Algorithms and Architectures, 1987, pp:70-76 [Conf]
  21. Amir M. Ben-Amram, Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
    The Subtree Max Gap Problem with Application to Parallel String Covering. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:501-510 [Conf]
  22. Manolis Christodoulakis, Costas S. Iliopoulos, Yoan José Pinzón Ardila
    Simple Algorithm for Sorting the Fibonacci String Rotations. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:218-225 [Conf]
  23. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Fast Evolutionary Chains. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:307-318 [Conf]
  24. Costas S. Iliopoulos, Maureen Korda
    Massively Parallel Suffix Array Construction. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1998, pp:371-380 [Conf]
  25. Costas S. Iliopoulos, Manal Mohamed
    Validation and Decomposition of Partially Occluded Images. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2002, pp:218-230 [Conf]
  26. M. Sohel Rahman, Costas S. Iliopoulos
    Pattern Matching Algorithms with Don't Cares. [Citation Graph (0, 0)][DBLP]
    SOFSEM (2), 2007, pp:116-126 [Conf]
  27. Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon
    A Bit-Parallel Suffix Automation Approach for (delta, gamma)-Matching in Music Retrieval. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2003, pp:211-223 [Conf]
  28. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2001, pp:59-67 [Conf]
  29. Qing Guo, Hui Zhang, Costas S. Iliopoulos
    Computing the Minimum Approximate lambda-Cover of a String. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:49-60 [Conf]
  30. Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas
    Motif Extraction from Weighted Sequences. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:286-297 [Conf]
  31. Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
    Linear Time Algorithm for the Longest Common Repeat Problem. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:10-17 [Conf]
  32. Manolis Christodoulakis, Costas S. Iliopoulos, Mohammad Sohel Rahman, William F. Smyth
    Song classifications for dancing. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:41-48 [Conf]
  33. Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
    A First Approach to Finding Common Motifs With Gaps. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:88-97 [Conf]
  34. Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon
    The Max-Shift Algorithm for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    Algorithm Engineering, 2001, pp:13-25 [Conf]
  35. Pavlos Antoniou, Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Pierre Peterlongo
    Finding Common Motifs with Gaps Using Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:69-77 [Conf]
  36. M. Sohel Rahman, Costas S. Iliopoulos, Laurent Mouchard
    Pattern Matching in Degenerate DNA/RNA Sequences. [Citation Graph (0, 0)][DBLP]
    WALCOM, 2007, pp:109-120 [Conf]
  37. Costas S. Iliopoulos
    Monte Carlo Circuits for the Abelian Permutation Group Intersection Problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:23, n:6, pp:697-705 [Journal]
  38. Alberto Apostolico, Costas S. Iliopoulos, Gad M. Landau, Baruch Schieber, Uzi Vishkin
    Parallel Construction of a Suffix Tree with Applications. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1988, v:3, n:, pp:347-365 [Journal]
  39. Maxime Crochemore, Costas S. Iliopoulos, Maureen Korda
    Two-Dimensional Prefix String Matching and Covering on Square Matrices. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:20, n:4, pp:353-373 [Journal]
  40. Costas S. Iliopoulos, D. W. G. Moore, Kunsoo Park
    Covering a String. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:3, pp:288-297 [Journal]
  41. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Computing Evolutionary Chains in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2001, v:8, n:2, pp:- [Journal]
  42. Maxime Crochemore, Costas S. Iliopoulos, Thierry Lecroq
    Occurrence and Substring Heuristics for i-Matching. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:1-2, pp:1-21 [Journal]
  43. Maxime Crochemore, Costas S. Iliopoulos, Yoan J. Pinzon
    Speeding-up Hirschberg and Hunt-Szymanski LCS Algorithms. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:1-2, pp:89-103 [Journal]
  44. Costas S. Iliopoulos, Christos Makris, Yannis Panagis, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis
    The Weighted Suffix Tree: An Efficient Data Structure for Handling Molecular Weighted Sequences and its Applications. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:71, n:2-3, pp:259-277 [Journal]
  45. Omer Berkman, Costas S. Iliopoulos, Kunsoo Park
    The Subtree Max Gap Problem with Application to Parallel String Covering. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:123, n:1, pp:127-137 [Journal]
  46. Aspassia Daskalopulu, Costas S. Iliopoulos, Manal Mohamed
    On-Line Analysis and Validation of Partially Occluded Images: Implementation and Practice. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:12, pp:1245-1257 [Journal]
  47. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Laurent Mouchard, Yoan J. Pinzon
    Algorithms for Computing Approximate Repetitions in Musical Sequences. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2002, v:79, n:11, pp:1135-1148 [Journal]
  48. Costas S. Iliopoulos, James A. M. McHugh, Pierre Peterlongo, Nadia Pisanti, Wojciech Rytter, Marie-France Sagot
    A first approach to finding common motifs with gaps. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1145-1154 [Journal]
  49. Costas S. Iliopoulos, James F. Reid
    Decomposition of Partially Occluded Strings in the Presence of Errors. [Citation Graph (0, 0)][DBLP]
    IJPRAI, 2001, v:15, n:7, pp:1129-1142 [Journal]
  50. Alberto Apostolico, Martin Farach, Costas S. Iliopoulos
    Optimal Superprimitivity Testing for Strings. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:1, pp:17-20 [Journal]
  51. W. M. Beynon, Costas S. Iliopoulos
    Computing a Basis for a Finite Abelian p-Group. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:3, pp:161-163 [Journal]
  52. Richard Cole, Costas S. Iliopoulos, Thierry Lecroq, Wojciech Plandowski, Wojciech Rytter
    On special families of morphisms related to [delta]-matching and don't care symbols. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:85, n:5, pp:227-233 [Journal]
  53. Costas S. Iliopoulos
    Analysis of Algorithms on Problems in General Abelian Groups. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:4, pp:215-220 [Journal]
  54. Costas S. Iliopoulos
    Analysis of an Algorithm for Composition of Binary Quadratic Forms. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1982, v:3, n:2, pp:157-159 [Journal]
  55. Jan Holub, Costas S. Iliopoulos, Borivoj Melichar, Laurent Mouchard
    Distributed Pattern Matching Using Finite Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:2, pp:191-204 [Journal]
  56. Costas S. Iliopoulos, Laurent Mouchard
    Quasiperiodicity: From Detection to Normal Forms. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 1999, v:4, n:3, pp:213-228 [Journal]
  57. Costas S. Iliopoulos, Jamie Simpson
    On-Line Validation and Analysis of Partially Occluded Images. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:3, pp:291-303 [Journal]
  58. Diane Donovan, Costas S. Iliopoulos, Mirka Miller
    Editorial. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:555- [Journal]
  59. Maxime Crochemore, Costas S. Iliopoulos, Gonzalo Navarro, Yoan J. Pinzon, Alejandro Salinger
    Bit-parallel (delta, gamma)-matching and suffix automata. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:2-4, pp:198-214 [Journal]
  60. Inbok Lee, Costas S. Iliopoulos, Kunsoo Park
    Linear time algorithm for the longest common repeat problem. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:243-249 [Journal]
  61. Costas S. Iliopoulos, Katerina Perdikuri, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas
    Algorithms for extracting motifs from biological weighted sequences. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2007, v:5, n:2, pp:229-242 [Journal]
  62. Costas S. Iliopoulos, Manal Mohamed, Laurent Mouchard, Katerina Perdikuri, William F. Smyth, Athanasios K. Tsakalidis
    String Regularities with Don't Cares. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2003, v:10, n:1, pp:40-51 [Journal]
  63. Maxime Crochemore, Costas S. Iliopoulos, Christos Makris, Wojciech Rytter, Athanasios K. Tsakalidis, T. Tsichlas
    Approximate String Matching with Gaps. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2002, v:9, n:1, pp:54-65 [Journal]
  64. Costas S. Iliopoulos, James F. Reid
    Optimal parallel analysis and decomposition of partially occluded strings. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 2000, v:26, n:4, pp:483-494 [Journal]
  65. Clive N. Galley, Costas S. Iliopoulos
    A Simple Parallel Algorithm for the Single Function Coarsest Partition Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1994, v:4, n:, pp:437-445 [Journal]
  66. Costas S. Iliopoulos, Yoan J. Pinzon
    Recovering an LCS in O(n2/w) Time and Space. [Citation Graph (0, 0)][DBLP]
    Revista Comlombiana de Computación, 2002, v:3, n:1, pp:41-51 [Journal]
  67. Costas S. Iliopoulos
    Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:658-669 [Journal]
  68. Costas S. Iliopoulos
    Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1989, v:18, n:4, pp:670-678 [Journal]
  69. Raphaël Clifford, Costas S. Iliopoulos
    Approximate string matching for music analysis. [Citation Graph (0, 0)][DBLP]
    Soft Comput., 2004, v:8, n:9, pp:597-603 [Journal]
  70. Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    Longest repeats with a block of k don't cares. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:248-254 [Journal]
  71. Jacqueline W. Daykin, Costas S. Iliopoulos, William F. Smyth
    Parallel RAM Algorithms for Factorizing Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:127, n:1, pp:53-67 [Journal]
  72. Costas S. Iliopoulos
    Combinatorial Algorithms - Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:249, n:2, pp:241- [Journal]
  73. Costas S. Iliopoulos
    Computing in General Abelian Groups is Hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:81-93 [Journal]
  74. Costas S. Iliopoulos
    On the Computational Complexity of the Abelian Permutation Group Structure, Membership and Intersection Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:56, n:, pp:211-222 [Journal]
  75. Costas S. Iliopoulos, Laurent Mouchard
    Quasiperiodicity and String Covering. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:218, n:1, pp:205-216 [Journal]
  76. Costas S. Iliopoulos, Dennis Moore, William F. Smyth
    A Characterization of the Squares in a Fibonacci String. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:281-291 [Journal]
  77. Costas S. Iliopoulos, Kunsoo Park
    A Work-Time Optimal Algorithm for Computing All String Covers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:299-310 [Journal]
  78. Costas S. Iliopoulos, William F. Smyth
    Optimal Algorithms for Computing the canonical form of a circular string. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:92, n:1, pp:87-105 [Journal]
  79. Joong Chae Na, Alberto Apostolico, Costas S. Iliopoulos, Kunsoo Park
    Truncated suffix trees and their application to data compression. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:304, pp:87-101 [Journal]
  80. Jeong Seop Sim, Costas S. Iliopoulos, Kunsoo Park, William F. Smyth
    Approximate periods of strings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:557-568 [Journal]
  81. M. Sohel Rahman, Costas S. Iliopoulos
    A New Efficient Algorithm for Computing the Longest Common Subsequence. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:82-90 [Conf]
  82. Costas S. Iliopoulos, Marcin Kubica, M. Sohel Rahman, Tomasz Walen
    Algorithms for Computing the Longest Parameterized Common Subsequence. [Citation Graph (0, 0)][DBLP]
    CPM, 2007, pp:265-273 [Conf]
  83. Maxime Crochemore, Costas S. Iliopoulos, M. Sohel Rahman
    Finding Patterns in Given Intervals. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:645-656 [Conf]
  84. Inbok Lee, Costas S. Iliopoulos, Syng-Yup Ohn
    Transformation of Suffix Arrays into Suffix Trees on the MPI Environment. [Citation Graph (0, 0)][DBLP]
    RSFDGrC, 2007, pp:248-255 [Conf]
  85. M. Sohel Rahman, Costas S. Iliopoulos
    Indexing Factors with Gaps. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:465-474 [Conf]
  86. Julien Allali, Pascal Ferraro, Pierre Hanna, Costas S. Iliopoulos
    Local Transpositions in Alignment of Polyphonic Musical Sequences. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2007, pp:26-38 [Conf]
  87. Yoan José Pinzón Ardila, Costas S. Iliopoulos, Gad M. Landau, Manal Mohamed
    Approximation algorithm for the cyclic swap problem. [Citation Graph (0, 0)][DBLP]
    Stringology, 2005, pp:190-200 [Conf]
  88. Costas S. Iliopoulos, M. Sohel Rahman, Michal Vorácek, Ladislav Vagner
    The Constrained Longest Common Subsequence Problem for Degenerate Strings. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:309-311 [Conf]
  89. A. Bakalis, Costas S. Iliopoulos, Christos Makris, Spyros Sioutas, Evangelos Theodoridis, Athanasios K. Tsakalidis, Kostas Tsichlas
    Locating Maximal Multirepeats in Multiple Strings Under Various Constraints. [Citation Graph (0, 0)][DBLP]
    Comput. J., 2007, v:50, n:2, pp:178-185 [Journal]
  90. Qing Guo, Hui Zhang, Costas S. Iliopoulos
    Computing the lambda-covers of a string. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:19, pp:3957-3967 [Journal]
  91. Emilios Cambouropoulos, Maxime Crochemore, Costas S. Iliopoulos, Manal Mohamed, Marie-France Sagot
    All maximal-pairs in step-leap representation of melodic sequence. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2007, v:177, n:9, pp:1954-1962 [Journal]

  92. Varieties of Regularities in Weighted Sequences. [Citation Graph (, )][DBLP]


  93. A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches. [Citation Graph (, )][DBLP]


  94. An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences. [Citation Graph (, )][DBLP]


  95. Cover Array String Reconstruction. [Citation Graph (, )][DBLP]


  96. Algorithms for Three Versions of the Shortest Common Superstring Problem. [Citation Graph (, )][DBLP]


  97. Bounds on Powers in Strings. [Citation Graph (, )][DBLP]


  98. Combinatorial ECG analysis for mobile devices. [Citation Graph (, )][DBLP]


  99. A New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns. [Citation Graph (, )][DBLP]


  100. Efficient Algorithms for Two Extensions of LPF Table: The Power of Suffix Arrays. [Citation Graph (, )][DBLP]


  101. Improved Algorithms for the Range Next Value Problem and Applications. [Citation Graph (, )][DBLP]


  102. Conservative String Covering of Indeterminate Strings. [Citation Graph (, )][DBLP]


  103. Parallel Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies. [Citation Graph (, )][DBLP]


  104. Validation and Decomposition of Partially Occluded Images with Holes. [Citation Graph (, )][DBLP]


  105. Indexing Circular Patterns. [Citation Graph (, )][DBLP]


  106. Indexing Factors in DNA/RNA Sequences. [Citation Graph (, )][DBLP]


  107. Implementation of a Swap Matching Algorithm Using a Graph Theoretic Model. [Citation Graph (, )][DBLP]


  108. On the Maximal Number of Cubic Runs in a String. [Citation Graph (, )][DBLP]


  109. LPF Computation Revisited. [Citation Graph (, )][DBLP]


  110. Indexing Factors with Gaps. [Citation Graph (, )][DBLP]


  111. On the maximal number of highly periodic runs in a string [Citation Graph (, )][DBLP]


Search in 0.147secs, Finished in 0.153secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002