This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

Background The read length of single-molecule DNA sequencers is reaching 1 Mb. Popular
alignment software tools widely used for analyzing such long reads often take advantage of …

In modern datacenter networks (DCNs), failures of network devices are the norm rather than
the exception, and many research efforts have focused on dealing with failures after they …

A one-of-a-kind survey of the field of Reconfigurable Computing Gives a comprehensive
introduction to a discipline that offers a 10X-100X acceleration of algorithms over …

Given two strings, the longest common subsequence (LCS) problem consists in computing
the length of the longest string that is a subsequence of both input strings. Its generalisation …

String similarity measures are among the most fundamental problems in computer science.
The notable examples are edit distance (ED) and longest common subsequence (LCS) …

A noticeable fraction of Algorithms papers in the last few decades improve the running time
of well-known algorithms for fundamental problems by logarithmic factors. For example, the …

In this paper we study the fine-grained complexity of finding exact and approximate solutions
to problems in P. Our main contribution is showing reductions from an exact to an …

Abstract The Longest Common Subsequence (LCS) is one of the most basic similarity
measures and it captures important applications in bioinformatics and text analysis …

Functional Arabic Morphology is a formulation of the Arabic inflectional system seeking the
working interface between morphology and syntax. ElixirFM is its high-level implementation …