Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
Tuyển tập các báo cáo nghiên cứu về sinh học được đăng trên tạp chí y học Molecular Biology cung cấp cho các bạn kiến thức về ngành sinh học đề tài: Lossless filter for multiple repeats with bounded edit distance. | Algorithms for Molecular Biology BioMed Zentral Research Open Access Lossless filter for multiple repeats with bounded edit distance Pierre Peterlongo 1 Gustavo Akio Tominaga Sacomoto2 Alair Pereira do Lago3 Nadia Pisanti4 and Marie-France Sagot5 6 Address 1Équipe-projet Symbiose IRISA CNRS Campus de Beaulieu Rennes France 2Curso Experimental de Ciências Moleculares da Universidade de São Paulo Brazil 3Instituto de Matemática e Estatística da Universidade de São Paulo Brazil 4Dipartimento di Informatica Università di Pisa Italy 5Équipe BAOBAB Laboratoire de Biométrie et Biologie Evolutive UMR 5558 CNRS Univ. Lyon 1 Villeurbanne Cedex France and Équipe-Projet BAMBOO INRIA Rhône-Alpes France and 6King s College London UK E-mail Pierre Peterlongo - pierre.peterlongo@irisa.fr Gustavo Akio Tominaga Sacomoto - sacomoto@gmail.com Alair Pereira do Lago - alair@ime.usp.br Nadia Pisanti - pisanti@di.unipi.it Marie-France Sagot - Marie-France.Sagot@inria.fr Corresponding author Published 30 January 2009 Received 14 September 2008 Algorithms for Molecular Biology 2009 4 3 doi I0.II86 I748-7I88-4-3 Accepted 30 January 2009 This article is available from http www.almob.Org content 4 I 3 2009 Peterlongo et al licensee BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License http creativecommons.org licenses by 2.0 which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. Abstract Background Identifying local similarity between two or more sequences or identifying repeats occurring at least twice in a sequence is an essential part in the analysis of biological sequences and of their phylogenetic relationship. Finding such fragments while allowing for a certain number of insertions deletions and substitutions is however known to be a computationally expensive task and consequently exact methods can usually not be applied in practice. Results The filter .
