Author Description

Excerpt from An Efficient String Matching Algorithm With K Differences for Nucleotide and Amino Acid Sequences <p>A simple approach to finding good alignments was devised by Tinoco et al (3) and by Maizel and Lenk It constructs an a matrix and scores matches of minimal lengths. The resulting diagonals are then visually inspected. For homologous sequences an elongated. <p>About the Publisher <p>Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com <p>This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.