StringMasters @ Murdoch University

October 26-29, 2015

StringMasters was established in 2007 with the aim of bringing together researchers in string algorithms at all levels to study current problems of particular theoretical and practical interest. It is informal, with no scheduled presentations, entirely devoted to new research resulting from the interactions among the participants.

Typically small impromptu groups form, of about 2 to 5 researchers, who share a common interest in a problem. Old collaborations are reinforced, and new collaborations are formed. The workshop is accommodated in several meeting rooms to allow space for the parallel working groups and for general milling around.

All interested participants are welcome!

There are no registration fees. To register your intention to participate in the workshop, please contact us.

For more details about the history of StringMasters, see:

Organising Committee

Registered Participants

[as of October 1, 2015]


StringMasters is focussed on activating research and publishing papers that emerge out of discussions at the workshops. The research output of the Murdoch edition of StringMasters will be published in special issue of the Journal of Discrete Algorithms.

Accommodation & Directions

We recommend seeking out accommodation in either Fremantle or the Perth CBD as it is easy to reach Murdoch University from either of these locations by bus and/or train. Directions can be found on the Murdoch website (including campus maps) and the TransPerth website. Alternatively, you can get public transport directions using Google Maps.

Internet Access @ Murdoch

All visiting guests of Murdoch University who are from a university that is federated to Eduroam will have full access to the Murdoch wireless network. For more details, see



Room: ECL1.031 (Building 17)

10:00 – Welcome by Prof Glenn HefterAssociate Dean of Research, School of Eng & IT
10:15 – Kunsoo Park: Multiple order preserving matching
11:00 – Presentation of open problems by participants
12:00 – Problem solving session
13:00 – Lunch
14:00 – Problem solving session
15:15 – Afternoon tea
15:45 – Gary Benson: Bit-parallel sequence alignment algorithms
16:30 – Close of day


Room: LL1.005 (Building 26)

10:30 – Ljiljana Brankovic: Genome sequencing and superbubbles
11:15 – Problem solving session
12:30 – Lunch
13:30 – Problem solving session
15:15 – Afternoon tea
15:45 – Fatima Vayani: Circular sequence comparison with q-grams
16:30 – Close of day


Room: ECL2.031 (Building 17)

10:30 – Hideo Bannai: Runs, Lyndon words, and Lyndon trees
11:15 – Problem solving session
12:30 – Lunch
13:30 – Problem solving session
15:15 – Afternoon tea
15:45 – Bill Smyth: An elementary O(nlogn) algorithm for computing runs
16:30 – Close of day


Senate Conference Room (Building 11)

10:30 – Talk by …
11:15 – Problem solving session
12:30 – Lunch
13:30 – Problem solving session
15:15 – Afternoon tea
15:45 – Talk by …
16:30 – Close of day

Schedule in PDF