King's College London

Research portal

Research Outputs

  1. 2020
  2. Shortest covers of all cyclic shifts of a string

    Crochemore, M., Iliopoulos, C. S., Radoszewski, J., Rytter, W., Straszyński, J., Waleń, T. & Zuba, W., 20 Feb 2020, WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Proceedings. Rahman, M. S., Sadakane, K. & Sung, W-K. (eds.). SPRINGER, p. 69-80 12 p. 69. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12049 LNCS).

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

  3. 2019
  4. Quasi-Linear-Time Algorithm for Longest Common Circular Factor

    Alzamel, M., Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Radoszewski, J., Rytter, W., Straszynski, J., Walen, T. & Zuba, W., 6 Jun 2019, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Pisanti, N. & Pissis, S. P. (eds.). LIPIcs, Vol. 128. p. 25:1–25:14

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

  5. K-abelian pattern matching: Revisited, corrected, and extended

    Badkobeh, G., Bannai, H., Crochemore, M., I, T., Inenaga, S. & Sugimoto, S., 1 Jan 2019, Proceedings of the Prague Stringology Conference, PSC 2019. Holub, J. & Zdarek, J. (eds.). Prague Stringology Club, p. 29-40 12 p. (Proceedings of the Prague Stringology Conference, PSC 2019).

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

  6. 2018
  7. How Much Different Are Two Words with Different Shortest Periods

    Alzamel, M., Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Kundu, R., Radoszewski, J., Rytter, W. & Wale, T., 2018, Artificial Intelligence Applications and Innovations: AIAI 2018 IFIP WG 12.5 International Workshops, SEDSEAL, 5G-PINE, MHDW, and HEALTHIOT, Rhodes, Greece, May 25-27, 2018, Proceedings. Iliadis, L., Maglogiannis, I. & Plagianakos, V. (eds.). Cham: Springer International Publishing, p. 168-178 11 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  8. Linear-Time Algorithm for Long LCF with k Mismatches

    Charalampopoulos, P., Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Pissis, S. P., Radoszewski, J., Rytter, W. & Walen, T., 2018, Annual Symposium on Combinatorial Pattern Matching (CPM 2018). Navarro, G., Sankoff, D. & Zhu, B. (eds.). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Vol. 105. p. 23:1-23:16 (Leibniz International Proceedings in Informatics (LIPIcs)).

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

  9. On Extended Special Factors of a Word

    Charalampopoulos, P., Crochemore, M. & Pissis, S. P., 2018, SPIRE 18, Proceedings of the 25th international conference on String processing and information retrieval. Springer Verlag, (LNCS).

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

  10. 2017
  11. 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

  12. 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

  13. 2016
  14. 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

  15. 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

  16. 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

  17. 2015
  18. Science forum: RIPOSTE: a framework for improving the design and analysis of laboratory-based research.

    Masca, N. G. D., Hensor, E. M. A., Cornelius, V. R., Buffa, F. M., Marriott, H. M., Eales, J. M., Messenger, M. P., Anderson, A. E., Boot, C., Bunce, C., Goldin, R. D., Harris, J., Hinchliffe, R. F., Junaid, H., Kingston, S., Martin-Ruiz, C., Nelson, C. P., Peacock, J., Seed, P. T., Shinkins, B. & 4 others, Staples, K. J., Toombs, J., Wright, A. K. A. & Teare, M. D., 2015, eLife. p. e05519 (eLife; vol. 4).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  19. 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

  20. 2014
  21. 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

  22. 2013
  23. 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

  24. 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

  25. 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

  26. 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

  27. 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

  28. 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

  29. 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

  30. 2012
  31. 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

  32. 2011
  33. 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

  34. 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

  35. 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

  36. 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

  37. 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

  38. 2010
  39. 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

  40. 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

  41. 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

  42. 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

  43. 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

  44. 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

  45. 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

  46. 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

  47. 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

  48. Oxidative Stress and redox signalling in cardiac remodelling

    Zhang, M., Sirker, A. & Shah, A., 2010, Oxidative Stress in Applied Basic Research and Clinical Practice: Studies on Cardiovascular Disorders. Sauer, H., Shah, AM. & Laurindo, FRM. (eds.). Springer Humana, p. 405 - 424 20 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  49. 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

  50. 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

  51. 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

  52. 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

  53. 2009
  54. Repetitions in strings: algorithms and combinatorics

    Crochemore, M., Ilie, L. & Rytter, W., 17 Nov 2009, In : Theoretical Computer Science. 410, 50, p. 5227 - 5235 9 p.

    Research output: Contribution to journalConference paper

  55. From Nerode's congruence to suffix automata with mismatches

    Crochemore, M., Epifanio, C., Gabriele, A. & Mignosi, F., 1 Sep 2009, In : Theoretical Computer Science. 410, 37, p. 3471 - 3480 10 p.

    Research output: Contribution to journalConference paper

  56. A prospective study of pregnancy outcome and biomarkers of oxidative stress in nulliparous obese women

    Rajasingam, D., Seed, P. T., Briley, A. L., Shennan, A. H. & Poston, L., Apr 2009, In : American Journal of Obstetrics and Gynecology. 200, 4, p. 395.e1-395.e9 9 p.

    Research output: Contribution to journalConference paper

  57. 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

  58. 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

  59. 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

  60. 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

  61. 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

  62. 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

Previous 1 2 Next

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

Refine results Clear filters

Language

Language

Publication year

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