- DCJ-indel Distance with Distinct Operation CostsPoly H., da Silva; Marília D. V., Braga; Raphael, Machado; Simone, DantasLecture Notes in Computer Science, Springer Berlin Heidelberg, 378-390, 2012.
- The Longest Common Subsequence Problem with Crossing-Free Arc-Annotated SequencesGuillaume Blin; Minghui Jiang; Stéphane VialetteString Processing and Information Retrieval, Springer Berlin Heidelberg, 130-142, 2012.
- From de Bruijn Graphs to Rectangle Graphs for Genome AssemblyNikolay, Vyahhi; Alex, Pyshkin; Son, Pham; Pavel A., PevznerLecture Notes in Computer Science, Springer Berlin Heidelberg, 249-261, 2012.被引 4
书籍章节
Tandem Halving Problems by DCJ
8阅读
