Title of article
Walking tree heuristics for comparative genomic alignments
Author/Authors
Cavener، نويسنده , , Jeffrey D and Cull، نويسنده , , Paul H. Holloway، نويسنده , , James L and Hsu، نويسنده , , Yu-Tai Ching، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
13
From page
207
To page
219
Abstract
Genomic sequence data is available for an ever-increasing number of organisms, but the full meaning of this data remains an enigma. String alignment is one approach for deciphering the information contained in genetic strings. Sequences which are conserved across species will help identify genes and other important structures. Similarity between species can be scored by measuring how well their sequences align. The walking tree method is an approximate string alignment method that can handle insertions, deletions, substitutions, translocations, and more than one level of inversion. We will describe this method and recent improvements which allow fast alignment of megabase strings. We will show examples in which the method located or discovered genes. We show how the method can be used to construct phylogenetic trees. We also show that the method can be used to identify essential regions for protein function.
Keywords
Genome visualization , swaps , Translocations , Genomic sequence alignment , Walking tree , Inversions
Journal title
Mathematical Biosciences
Serial Year
2004
Journal title
Mathematical Biosciences
Record number
1590067
Link To Document