( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Beyond the BEST Theorem: Fast Assessment of Eulerian Trails.

, , , , , и . FCT, том 12867 из Lecture Notes in Computer Science, стр. 162-175. Springer, (2021)

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.

Nadia Kapernaum

Nadia Klein

Nadia Müller

Nadia Sallam

Nadia Harbeck

 

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

Optimal Listing of Cycles and St-paths in Undirected Graphs, , , , , , и . Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, стр. 1884--1896. SIAM, (2013)Online Algorithms on Antipowers and Antiperiods., , , , , , , , и . SPIRE, том 11811 из Lecture Notes in Computer Science, стр. 175-188. Springer, (2019)Segment-based distances and similarities in genomic sequences.. University of Pisa, Italy, (2001)Inferring Mobile Elements in S. Cerevisiae Strains., , , , и . BIOINFORMATICS, стр. 131-136. SciTePress, (2011)Beyond the BEST Theorem: Fast Assessment of Eulerian Trails., , , , , и . FCT, том 12867 из Lecture Notes in Computer Science, стр. 162-175. Springer, (2021)Technology and Species Independent Simulation of Sequencing Data and Genomic Variants., , и . BIBE, стр. 138-145. IEEE, (2019)Longest Property-Preserved Common Factor., , , , , , и . SPIRE, том 11147 из Lecture Notes in Computer Science, стр. 42-49. Springer, (2018)Detecting Mutations by eBWT., , , и . WABI, том 113 из LIPIcs, стр. 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Relational Extension of the Notion of Motifs: Application to the Common 3D Protein Substructures Searching Problem., , , и . J. Comput. Biol., 16 (12): 1635-1660 (2009)On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem., , , , , и . CPM, том 9133 из Lecture Notes in Computer Science, стр. 100-113. Springer, (2015)