( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
An O(N2) Algorithm for Discovering Optimal Boolean Pattern Pairs.

, , , , , и . IEEE ACM Trans. Comput. Biol. Bioinform., 1 (4): 159-170 (2004)

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.

Heikki Leppänen

Heikki Solin

Heikki Lempa

Heikki Saaristo

Heikki Toomes

 

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

Bit-parallel approximate string matching algorithms with transposition.. J. Discrete Algorithms, 3 (2-4): 215-229 (2005)A Note on Bit-Parallel Alignment Computation.. Stringology, стр. 79-87. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University, (2004)BeLLE: Multinational Research Collaboration on Bebras & ViLLE., , и . ITiCSE (2), стр. 669. ACM, (2023)A Practical Index for Genome Searching., и . SPIRE, том 2857 из Lecture Notes in Computer Science, стр. 341-349. Springer, (2003)Notes on generating completely condensed d-neighborhoods.. IWOCA, стр. 16-26. College Publications, (2008)On Using Two-Phase Filtering in Indexed Approximate String Matching with Application to Searching Unique Oligonucleotides.. SPIRE, стр. 84-95. IEEE Computer Society, (2001)Mining Bit-Parallel LCS-length Algorithms.. SPIRE, том 10508 из Lecture Notes in Computer Science, стр. 214-220. Springer, (2017)On computation of calcium cycling anomalies in cardiomyocytes data., , , , , , , , , и 2 other автор(ы). EMBC, стр. 1444-1447. IEEE, (2014)Restricted Transposition Invariant Approximate String Matching Under Edit Distance.. SPIRE, том 3772 из Lecture Notes in Computer Science, стр. 256-266. Springer, (2005)Compacting a Dynamic Edit Distance Table by RLE Compression., и . SOFSEM, том 9587 из Lecture Notes in Computer Science, стр. 302-313. Springer, (2016)