King's College London

Research portal

Research Outputs

  1. 2017
  2. Minimal Absent Words in a Sliding Window and Applications to On-Line Pattern Matching

    Crochemore, M., Heliou, A., Kucherov, G., Mouchard, L., Pissis, S. P. & Ramusat, Y., 16 Aug 2017, Fundamentals of Computation Theory: 21st International Symposium, FCT 2017, Bordeaux, France, September 11--13, 2017, Proceedings. Klasing, R. & Zeitoun, M. (eds.). Berlin, Heidelberg: Springer Berlin Heidelberg, Vol. 10472. p. 164-176 13 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

  3. Efficient Enumeration of Non-Equivalent Squares in Partial Words with Few Holes

    Charalampopoulos, P., Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Pissis, S. P., Radoszewski, J., Rytter, W. & Walen, T., 1 Jul 2017, Computing and Combinatorics: 23rd International Conference, COCOON 2017, Hong Kong, China, August 3-5, 2017, Proceedings. Cao, Y. & Chen, J. (eds.). Cham: Springer International Publishing Switzerland, Vol. 10392. p. 99-111 13 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  4. 2016
  5. Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries

    Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Kundu, R., Pissis, S. P., Radoszewski, J., Rytter, W. & Walen, T., 21 Sep 2016, String Processing and Information Retrieval: 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings. Inenaga, S., Sadakane, K. & Sakai, T. (eds.). Cham: Springer International Publishing Switzerland, p. 22-34 13 p. (Lecture Notes in Computer Science; vol. 9954).

    Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

  6. Linear-Time Sequence Comparison Using Minimal Absent Words & Applications

    Crochemore, M., Fici, G., Mercas, R. & Pissis, S. P., Apr 2016, LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada, Mexico, April 11-15, 2016, Proceedings. Kranakis, E., Navarro, G. & Chávez, E. (eds.). Springer Berlin Heidelberg, p. 334-346 13 p.

    Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

  7. Optimal bounds for computing α-gapped repeats

    Crochemore, M., Kolpakov, R. & Kucherov, G., 26 Feb 2016, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer‐Verlag Berlin Heidelberg, Vol. 9618. p. 245-255 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9618).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  8. 2015
  9. Text redundancies

    Badkobeh, G., Crochemore, M., Iliopoulos, C. S. & Kubica, M., 2015, Combinatorics, Words and Symbolic Dynamics. Berthe, V. & Rigo, M. (eds.). Cambridge University Press, p. 151-174 24 p.

    Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

  10. 2014
  11. Associations between working memory and white matter integrity in normal ageing

    Charlton, R. A. & Morris, R., 1 Jan 2014, Working Memory and Ageing. Taylor and Francis, p. 97-128 32 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  12. Introduction: Working memory and the ageing brain

    Logie, R. H. & Morris, R., 2014, Working Memory and Ageing. Psychology Press

    Research output: Chapter in Book/Report/Conference proceedingChapter

  13. Maximal anti-exponent of gapped palindromes

    Badkobeh, G., Crochemore, M. & Toopsuwan, C., 2014, 2014 4th International Conference on Digital Information and Communication Technology and Its Applications, DICTAP 2014. IEEE Computer Society Press, p. 205-210 6 p. 6821683

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  14. 2013
  15. A constant-space comparison-based algorithm for computing the Burrows-Wheeler transform

    Crochemore, M., Grossi, R., Kärkkäinen, J. & Landau, G. M., 2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7922 LNCS. p. 74-82 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7922 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  16. Forty years of text indexing

    Apostolico, A., Crochemore, M., Farach-Colton, M., Galil, Z. & Muthukrishnan, S., 2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7922 LNCS. p. 1-10 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7922 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  17. Locating all maximal approximate runs in a string

    Amit, M., Crochemore, M. & Landau, G. M., 2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 7922 LNCS. p. 13-27 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7922 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  18. Longest common substrings, related problems and applications

    Crochemore, M., Langiu, A., Mignosi, F. & Mirisola, M., 2013, Biologicla Knowledge, Discovery Handbook. Elloumi, M. & Zomaya, A. Y. (eds.). John Wiley & Sons, Inc, p. 3-27 25 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  19. Order-Preserving Incomplete Suffix Trees and Order-Preserving Indexes

    Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Kubica, M., Langiu, A., Pissis, S. P., Radoszewski, J., Rytter, W. & Walen, T., 2013, String Processing and Information Retrieval. Kurland, O., Lewenstein, M. & Porat, E. (eds.). Springer International Publishing, p. 84-95 12 p. (Lecture Notes in Computer Science; vol. 8214).

    Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

  20. Suffix tree of alignment: An efficient index for similar data

    Na, J. C., Park, H., Crochemore, M., Holub, J., Iliopoulos, C. S., Mouchard, L. & Park, K., 2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8288 LNCS. p. 337-348 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8288 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  21. The rightmost Equal-Cost Position problem

    Crochemore, M., Langiu, A. & Mignosi, F., 2013, Data Compression Conference Proceedings. p. 421-430 10 p. 6543078

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  22. 2012
  23. Computing the Maximal-Exponent Repeats of an Overlap-Free String in Linear Time

    Badkobeh, G., Crochemore, M. & Toopsuwan, C., 2012, String Processing and Information Retrieval: 19th International Symposium, SPIRE 2012, Cartagena de Indias, Colombia, October 21-25, 2012. Proceedings. Springer, p. 61-72 12 p. (Lecture Notes in Computer Science; vol. 7608).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  24. 2011
  25. Computing All Subtree Repeats in Ordered Ranked Trees

    Christou, M., Crochemore, M., Flouri, T., Iliopoulos, C. S., Janousek, J., Melichar, B. & Pissis, S., 2011, String Processing and Information Retrieval: 18th International Symposium, SPIRE 2011, Pisa, Italy, October 17-21, 2011. Proceedings. Grossi, R., Sebastiani, F. & Silvestri, F. (eds.). N/A ed. Berlin: Springer Berlin Heidelberg, Vol. N/A. p. 338-343 6 p. (Lecture Notes in Computer Science; vol. 7024).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  26. Dictionary-Symbolwise Flexible Parsing

    Crochemore, M., Giambruno, L., Langiu, A., Mignosi, F. & Restivo, A., 2011, Unknown. BERLIN: Springer, Vol. 6460 LNCS. p. 390 - 403 14 p. (COMBINATORIAL ALGORITHMS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  27. Efficient Seeds Computation Revisited

    Christou, M., Crochemore, M., Iliopoulos, C., Kubica, M., Pissis, S., Radoszewski, J., Rytter, W., Szreder, B. & Walen, T., 2011, Combinatorial Pattern Matching: 22nd Annual Symposium, CPM 2011, Palermo, Italy, June 27-29, 2011. Proceedings. Giancarlo, R. & Manzini, G. (eds.). Springer, Vol. 6661. p. 350-363 14 p. (Lecture Notes in Computer Science; vol. 6661).

    Research output: Chapter in Book/Report/Conference proceedingOther chapter contribution

  28. On the Maximal Sum of Exponents of Runs in a String

    Crochemore, M., Kubica, M., Radoszewski, J., Rytter, W. & Walen, T., 2011, Unknown. BERLIN: Springer, p. 10 - 19 10 p. (COMBINATORIAL ALGORITHMS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  29. On the Right-Seed Array of a String

    Christou, M., Crochemore, M., Guth, O., Iliopoulos, C. S. & Pissis, S. P., 2011, Computing and Combinatorics: 17th Annual International Conference, COCOON 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings. Fu, B. & Du, D-Z. (eds.). Springer Berlin Heidelberg, Vol. 6842. p. 492-502 11 p. (Lecture Notes in Computer Science; vol. 6842).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  30. 2010
  31. Algorithms for Three Versions of the Shortest Common Superstring Problem

    Crochemore, M., Cygan, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W. & Walen, T., Jun 2010, COMBINATORIAL PATTERN MATCHING, PROCEEDINGS. BERLIN: Springer, Vol. 6129. p. 299 - 309 11 p. (Lecture Notes in Computer Science).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  32. A Parallel Algorithm for Fixed-Length Approximate String-Matching with k-mismatches

    Crochemore, M., Iliopoulos, C. S. & Pissis, S., 2010, Algorithms and Applications: Essays Dedicated to Esko Ukkonen on the Occasion of His 60th Birthday. Elomaa, T., Mannila, H. & Orponen, P. (eds.). N/A ed. Berlin: Springer, Vol. N/A. p. 92 - 101 10 p. (Lecture Notes in Computer Science; vol. 6060).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  33. Bounded number of squares in infinite repetition-constrained binary words

    Badkobeh, G. & Crochemore, M., 2010, Prague Stringology Conference. Czech Technical University, p. 161 - 166 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  34. Cover array string reconstruction

    Crochemore, M., Iliopoulos, C. S., Pissis, S. & Tischler, G., 2010, Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings. Amir, A. & Panda, L. (eds.). N/A ed. Berlin ; New York: Springer Berlin Heidelberg, Vol. N/A. p. 251 - 259 9 p. (Lecture Notes in Computer Science; vol. 6129).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  35. Efficient algorithms for two extensions of LPF table: the power of suffix arrays

    Crochemore, M., Iliopoulos, C., Kubica, M., Rytter, W. & Walen, T., 2010, SOFSEM 2010: Theory and Practice of Computer Science 36th Conference on Current Trends in Theory and Practice of Computer Science, . Unknown Publisher, Vol. 5901 LNCS. p. 296 - 307 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  36. Extracting powers and periods in a string from its runs structure

    Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W. & Walen, T., 2010, String Processing and Information Retrieval: 17th International Symposium, SPIRE 2010, Los Cabos, Mexico, October 11-13, 2010. Proceedings. BERLIN: Springer, p. 258 - 269 12 p. (Lecture Notes in Computer Science; vol. 6393).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  37. Gapped Suffix Arrays: a New Index Structure for Fast Approximate Matching

    Crochemore, M. & Tischler, G., 2010, String Processing and Information Retrieval - SPIRE 2010. Springer, Vol. 6393 LNCS. p. 359 - 364 6 p. (Lecture Notes in Computer Science 6393).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  38. New Simple Efficient Algorithms Computing Powers and Runs in Strings

    Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W. & Walen, T., 2010, Prague Stringology Conference. Czech Technical University, p. 138-149 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  39. On the maximal number of cubic runs in a string

    Crochemore, M., Iliopoulos, C., Kubica, M., Radoszewski, J., Rytter, W. & Walen, T., 2010, Language and Automata Theory and Applications: 4th International Conference, LATA 2010, Trier, Germany, May 24-28, 2010. Proceedings. BERLIN: Springer, p. 227 - 238 12 p. (Lecture Notes in Computer Science; vol. 6031).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  40. Pattern matching in strings

    Crochemore, M. & Hancart, C., 2010, Algorithms and Theory of Computation Handbook. Atallah, J. & Blanton, M. (eds.). CRC Press, p. ? - ? 12 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  41. Reactive links to save automata states

    Crochemore, M. & Gabbay, D., 2010, Prague Stringology Conference. Czech Technical University, p. 1 - 8 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  42. Text data compression algorithms

    Crochemore, M. & Lecroq, T., 2010, Algorithms and Theory of Computation Handbook. Atallah, J. & Blanton, M. (eds.). CRC Press, p. ? - ?

    Research output: Chapter in Book/Report/Conference proceedingChapter

  43. The Gapped Suffix Array: A New Index Structure for Fast Approximate Matching

    Crochemore, M. & Tischler, G., 2010, Unknown. BERLIN: Springer, Vol. 6393 LNCS. p. 359 - 364 6 p. (STRING PROCESSING AND INFORMATION RETRIEVAL).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  44. 2009
  45. Efficient Computing of Longest Previous Reverse Factors

    Chairungsee, S. & Crochemore, M., 2009, Seventh International Conference on Computer Science and Information Technologies (CSIT 2009). The National Academy of Sciences of Armenia, p. 27 - 30 4 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  46. Finding the median of three permutations under the Kendall-tau distance

    Blin, G., Crochemore, M., Hamel, S. & Vialette, S., 2009, Extended Abstract in the 7th Annual International Conference on Permutation Patterns. Unknown Publisher, p. 1 - 1 1 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  47. LPF Computation Revisited

    Crochemore, M., Ilie, L., Iliopoulos, C. S., Kubica, M., Rytter, W. & Walen, T., 2009, Unknown. BERLIN: Springer, Vol. 5874 LNCS. p. 158 - 169 12 p. (COMBINATORIAL ALGORITHMS).

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  48. On-line construction of a small automaton for a finite set of words

    Crochemore, M. & Giambruno, L., 2009, Proceedings of the Prage Stringology Conference 2009. Unknown Publisher, p. 15 - 28 14 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  49. Reverse engienering prefix tables

    Clément, J., Crochemore, M. & Rindone, G., 2009, 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009). Unknown Publisher, p. 289 - 300 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  50. Suffix Tree

    Crochemore, M. & Lecroq, T., 2009, Encyclopedia of Database Systems. Liu, L. & Tamer, M. (eds.). Springer, p. 2876 - 2880 5 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  51. Trie

    Crochemore, M. & Lecroq, T., 2009, Encyclopedia of Database Systems. Liu, L. & Tamer, M. (eds.). Springer, p. 3179 - 3182 4 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  52. 2008
  53. A simple algorithm for computing the Lempel-Ziv factorization

    Crochemore, M., Ilie, L. & Smyth, W. F., 2008, Dcc: 2008 Data Compression Conference, Proceedings. LOS ALAMITOS: IEEE COMPUTER SOC, p. 482 - 488 7 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  54. Alignments and approximate string matching

    Crochemore, M. & Lecroq, T., 2008, New Developments in Formal Languages and Applications. Bel-Enguix, G., Jim, M. D. & Mart, C. (eds.). Springer, p. 59 - 94 36 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  55. Bounds on powers in strings

    Crochemore, M., Fazekas, S. Z., Iliopoulos, C. & Jayasekera, I., 2008, Developments in Language Theory. Unknown Publisher, Vol. 5257 LNCS. p. 206 - 215 10 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  56. Computing a longest increasing subsequence of length $k$ in time {$O(n\log\log k)$

    Crochemore, M. & Porat, E., 2008, Visions of computer science. The British Computer Society, p. 69 - 74 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  57. Computing a longest increasing subsequence of length k in time O(n log log k)

    Crochemore, M. & Porat, E., 2008, Visions of Computing Science: BCS International Academic Conference. Gelenbe, E., Abramsky, S. & Sassone, V. (eds.). N/A ed. N/A: The British Computer Society, Swindon, UK, Vol. N/A. p. 69-74 6 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  58. Conservative string covering of indeterminate strings

    Antoniou, P., Crochemore, M., Iliopoulos, C., Jayasekera, I. & Landau, G. M., 2008, Prague Stringology Conference 2008. Unknown Publisher, p. 108 - 115 8 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  59. Improved algorithms for the range next value problem and applications

    Crochemore, M., Iliopoulos, C., Kubica, M., Rahman, M. S. & Wale'n, T., 2008, Symposium on Theoretical Aspects of Computer Science. Albers, S. & Weil, P. (eds.). IBFI Schloss Dagstuhl, p. 205-216 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

  60. Improved algorithms for the range next value problem and applications

    Crochemore, M., Iliopoulos, C., Kubica, M., Rahman, M. S. & Walen, T., 2008, Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science. Unknown Publisher, p. 205 - 216 12 p.

    Research output: Chapter in Book/Report/Conference proceedingConference paper

Previous 1 2 Next

Export:RIS BibTex Word PDF - will at most contain 500 items

Refine results Clear filters

Language

Language

Publication year

Full text

Full text

Meeting and poster abstracts

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454