Mathematics in Computer Science
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
Table of contents
- 111
-
ForewordIliopoulos, Costas S. / Langiu, Alessio et al. | 2017
- 113
-
On-line String Matching in Highly Similar DNA SequencesNsira, Nadia Ben / Elloumi, Mourad / Lecroq, Thierry et al. | 2017
- 127
-
On Representations of Ternary Order Relations in Numeric StringsKim, Jinil / Amir, Amihood / Na, Joong Chae et al. | 2017
- 137
-
Engineering a Lightweight External Memory Suffix Array Construction AlgorithmKärkkäinen, Juha / Kempa, Dominik et al. | 2017
- 151
-
Compressed Spaced Suffix ArraysGagie, Travis / Manzini, Giovanni / Valenzuela, Daniel et al. | 2017
- 159
-
Faster Average Case Low Memory Semi-external Construction of the Burrows–Wheeler TransformTischler, German et al. | 2017
- 177
-
On Succinct Representations of Binary TreesDavoodi, Pooya / Raman, Rajeev / Satti, Srinivasa Rao et al. | 2017
- 191
-
Block Graphs in PracticeGagie, Travis / Hoobin, Christopher / Puglisi, Simon J. et al. | 2017
- 197
-
Advanced Protein Alignments Based on Sequence, Structure and Hydropathy Profiles; The Paradigm of the Viral Polymerase EnzymeVlachakis, Dimitrios / Armaos, Alexandros / Kossida, Sophia et al. | 2017
- 209
-
Indeterminate String Factorizations and Degenerate Text TransformationsDaykin, Jacqueline W. / Watson, Bruce et al. | 2017
- 219
-
Palindromic Subsequence Automata and Longest Common Palindromic SubsequenceHasan, Md. Mahbubul / Islam, A. S. M. Sohidull / Rahman, M. Sohel et al. | 2017
- 233
-
Solving the Minimum Common String Partition Problem with the Help of AntsFerdous, S. M. / Rahman, M. Sohel et al. | 2017