Excerpt from An Efficient String Matching Algorithm With K Differences for Nucleotide and Amino Acid Sequences
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.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
"Sinopsis" puede pertenecer a otra edición de este libro.
Excerpt from An Efficient String Matching Algorithm With K Differences for Nucleotide and Amino Acid Sequences
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.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Forgotten Books, London, Reino Unido
Paperback. Condición: New. Print on Demand. This book is an account of the string matching algorithm designed by Gad M. Landau and Uzi Vishkin, and Ruth Nussinov. Adding to existing algorithms that allow mismatches, the newly designed algorithm uniquely allows mismatches, deletions, and insertions. This algorithm operates in significantly reduced time compared to existing algorithms, making this book important reading for those in the field of computer science. This book provides historical context, an outline of the algorithm's development, and insight into its usefulness. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. Nº de ref. del artículo: 9781333336356_0
Cantidad disponible: Más de 20 disponibles
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333336356
Cantidad disponible: 15 disponibles
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781333336356
Cantidad disponible: 15 disponibles