Finding local genome rearrangements
نویسندگان
چکیده
منابع مشابه
Computational Biology Lecture 18: Genome rearrangements, finding maximal matches
One possibility is to perform a global alignment of the two strings x and y with a special scoring sheme; for instance, +1 for a match, 0 for a mismatch, and 0 for a gap. Then we could identify all the maximal positively scoring chunks of the alignment. The disadvantages of this approach is that it requires O(mn) running time, might not obtain all candidate matches, and obtains matches that are...
متن کاملWith Micronuclear Genome Rearrangements
The micronuclear genome of Tetrahymena thermophila contains Tel-1 elements that structurally resemble transposons. Here we present molecular evidence that Tel-1 transposon-like elements are mobile. The arrangements of Tel-1 elements in the micronuclear genomes of several T. thermophila strains and cell lines were assayed by Southern blotting. The molecular evidence for Tel-1 transposition is mo...
متن کاملCombinatorics of Genome Rearrangements
All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher. Combinatorics of genome rearrangements / Guillaume Fertin. .. [et al.]. p. cm. — (Computational molecular biology) Includes bibliographical references and index. I...
متن کاملGlocal alignment: finding rearrangements during alignment
MOTIVATION To compare entire genomes from different species, biologists increasingly need alignment methods that are efficient enough to handle long sequences, and accurate enough to correctly align the conserved biological features between distant species. The two main classes of pairwise alignments are global alignment, where one string is transformed into the other, and local alignment, wher...
متن کاملPhylogenetic Invariants for Genome Rearrangements
We review the combinatorial optimization problems in calculating edit distances between genomes and phylogenetic inference based on minimizing gene order changes. With a view to avoiding the computational cost and the "long branches attract" artifact of some tree-building methods, we explore the probabilization of genome rearrangement models prior to developing a methodology based on branch-len...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms for Molecular Biology
سال: 2018
ISSN: 1748-7188
DOI: 10.1186/s13015-018-0127-2