( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance.

, , , и . IWOCA, том 8986 из Lecture Notes in Computer Science, стр. 49-61. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Ulrich Barton

Renate Barton

Thomas Barton

Annemarie Barton

Andrea Barton

 

Другие публикации лиц с тем же именем

On the average-case complexity of pattern matching with wildcards.. Theor. Comput. Sci., (2022)Identification of All Exact and Approximate Inverted Repeats in Regular and Weighted Sequences., , , и . EANN (2), том 384 из Communications in Computer and Information Science, стр. 11-19. Springer, (2013)Optimal Computation of all Repetitions in a Weighted String., и . ICABD, том 1146 из CEUR Workshop Proceedings, стр. 9-15. CEUR-WS.org, (2014)Longest Common Prefixes with k-Errors and Applications., , , , и . SPIRE, том 11147 из Lecture Notes in Computer Science, стр. 27-41. Springer, (2018)Fast and Simple Computations Using Prefix Tables Under Hamming and Edit Distance., , , и . IWOCA, том 8986 из Lecture Notes in Computer Science, стр. 49-61. Springer, (2014)Linear-Time Computation of Prefix Table for Weighted Strings., и . WORDS, том 9304 из Lecture Notes in Computer Science, стр. 73-84. Springer, (2015)Efficient Index for Weighted Sequences., , , и . CPM, том 54 из LIPIcs, стр. 4:1-4:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On-Line Pattern Matching on Uncertain Sequences and Applications., , и . COCOA, том 10043 из Lecture Notes in Computer Science, стр. 547-562. Springer, (2016)Linear-time computation of minimal absent words using suffix array., , , и . BMC Bioinform., (2014)Extending alignments with k-mismatches and ℓ-gaps., , , , , и . Theor. Comput. Sci., (2014)