Extracting powers and periods in a word from its runs structure von Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.

Volltext

A note on efficient computation of all Abelian periods in a string von Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Pachocki, J., Radoszewski, J., Rytter, W., Tyczyński, W., Waleń, T.

Volltext

The maximal number of cubic runs in a word von Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Waleń, T.

Volltext

A note on the longest common compatible prefix problem for partial words von Crochemore, M., Iliopoulos, C.S., Kociumaka, T., Kubica, M., Langiu, A., Radoszewski, J., Rytter, W., Szreder, B., Waleń, T.

Volltext

Efficient seed computation revisited von Christou, M., Crochemore, M., Iliopoulos, C.S., Kubica, M., Pissis, S.P., Radoszewski, J., Rytter, W., Szreder, B., Waleń, T.

Volltext

New simple efficient algorithms computing powers and runs in strings von Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Stencel, K., Waleń, T.

Volltext

A New Approach to Pattern Matching in Degenerate DNA/RNA Sequences and Distributed Pattern Matching von Iliopoulos, Costas S., Mouchard, Laurent, Rahman, M. Sohel

Volltext

Implementing approximate regularities von Christodoulakis, M., Iliopoulos, C.S., Park, Kunsoo, Sim, Jeong Seop

Volltext

Locating Maximal Multirepeats in Multiple Strings Under Various Constraints von Bakalis, A., Iliopoulos, C.S., Makris, C., Sioutas, S., Theodoridis, E., Tsakalidis, A., Tsichlas, K.

Volltext

Quasiperiodicity and string covering von ILIOPOULOS, C. S, MOUCHARD, L

Volltext

The Subtree Max Gap Problem with Application to Parallel String Covering von Berkman, O., Iliopoulos, C.S., Park, K.

Volltext

Parallel RAM algorithms for factorizing words von Daykin, J.W., Iliopoulos, C.S., Smyth, W.F.

Volltext

Practical and Efficient Algorithms for Degenerate and Weighted Sequences Derived from High Throughput Sequencing Technologies von Antoniou, P., Iliopoulos, C.S., Mouchard, L., Pissis, S.P.

Volltext bestellen

Computing a basis for a finite abelian p-group von Beynon, W.M., Iliopoulos, C.S.

Volltext

Speeding-up hirschberg and hunt-szymanski LCS algorithms von Crochemore, M., Iliopoulos, C.S., Pinzon, Y.J.

Volltext bestellen

Covering a String von Iliopoulos, D.W.G. Moore, K. Park, C.S.

Volltext