Author of the publication

Exemplar Longest Common Subsequence.

, , , , and . International Conference on Computational Science (2), volume 3992 of Lecture Notes in Computer Science, page 622-629. Springer, (2006)

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Beyond Evolutionary Trees., and . Encyclopedia of Algorithms, (2016)A novel algorithm for finding top-k weighted overlapping densest connected subgraphs in dual networks., , and . Appl. Netw. Sci., 6 (1): 40 (2021)Finding Colorful Paths in Temporal Graphs., and . COMPLEX NETWORKS, volume 1015 of Studies in Computational Intelligence, page 553-565. Springer, (2021)Covering a Graph with Densest Subgraphs., and . CALDAM, volume 13179 of Lecture Notes in Computer Science, page 152-163. Springer, (2022)Reconciling multiple genes trees via segmental duplications and losses., , and . Algorithms Mol. Biol., 14 (1): 7:1-7:19 (2019)Inferring (Biological) Signal Transduction Networks via Transitive Reductions of Directed Graphs, , , and . Electron. Colloquium Comput. Complex., (2006)Weak pattern matching in colored graphs: Minimizing the number of connected components., , and . ICTCS, page 27-38. World Scientific, (2007)Genetic Algorithms for Finding Episodes in Temporal Networks., , and . KES, volume 176 of Procedia Computer Science, page 215-224. Elsevier, (2020)Correcting Gene Trees by Leaf Insertions: Complexity and Approximation., and . ICTCS, volume 322 of Electronic Notes in Theoretical Computer Science, page 35-50. Elsevier, (2015)Insights into the Complexity of Disentangling Temporal Graphs.. ICTCS, volume 3284 of CEUR Workshop Proceedings, page 1-13. CEUR-WS.org, (2022)