Algorithms for extracting motifs from biological weighted sequences

被引：1
|
作者：
Iliopoulos, C. [1 ]
Perdikuri, K. [2 ,3 ]
Theodoridis, E. [2 ,3 ]
Tsakalidis, A. [2 ,3 ]
Tsichlas, K. [1 ]
机构：
[1] Kings Coll London, London WC2R 2LS, England
[2] Univ Patras, Comp Engn & Informat Dept, GR-26500 Patras, Greece
[3] Res Acad Comp Technol Inst RACTI, 61 Riga Feraiou Str, GR-26221 Patras 26221, Greece
来源：
JOURNAL OF DISCRETE ALGORITHMS | 2007年 / 5卷 / 02期
关键词：
Motif extraction; Biological weighted sequences;
D O I：
10.1016/j.jda.2006.03.018
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper we present three algorithms for the Motif Identification Problem in Biological Weighted Sequences. The first algorithm extracts repeated motifs from a biological weighted sequence. The motifs correspond to repetitive words which are approximately equal, under a Hamming distance, with probability of occurrence >= 1/k, where k is a small constant. The second algorithm extracts common motifs from a set of N >= 2 weighted sequences. In this case, the motifs consists of words that must occur with probability >= 1/k, in 1 <= q < N distinct sequences of the set. The third algorithm extracts maximal pairs from a biological weighted sequence. A pair in a sequence is the occurrence of the same word twice. In addition, the algorithms presented in this paper improve previous work on these problems. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：229 / 242
页数：14
相关论文
共 50 条
  • [31] Efficient parallel algorithms for processing biological sequences
    Rajasekaran, S
    Ammar, R
    Shin, DG
    Zhang, G
    PROCEEDINGS OF THE 3RD IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, 2003, : 487 - 490
  • [32] Efficient Algorithms for Extracting Biological Key Pathways with Global Constraints
    Baumbach, Jan
    Friedrich, Tobias
    Koetzing, Timo
    Krohmer, Anton
    Mueller, Joachim
    Pauling, Josch
    PROCEEDINGS OF THE FOURTEENTH INTERNATIONAL CONFERENCE ON GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2012, : 169 - 175
  • [33] Parallel algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies
    Iliopoulos, Costas S.
    Miller, Mirka
    Pissis, Solon P.
    PROCEEDINGS OF THE PRAGUE STRINGOLOGY CONFERENCE 2009, 2009, : 249 - 262
  • [34] Extracting algorithms from intuitionistic proofs
    Ferreira, F
    Marques, A
    MATHEMATICAL LOGIC QUARTERLY, 1998, 44 (02) : 143 - 160
  • [35] Weighted sequence motifs as an improved seeding step in microRNA target prediction algorithms
    Sætrom, O
    Snove, O
    Saetrom, P
    RNA, 2005, 11 (07) : 995 - 1003
  • [36] SSMBS: a web server to locate sequentially separated motifs in biological sequences
    Kumar, Chetan
    Sekar, K.
    JOURNAL OF APPLIED CRYSTALLOGRAPHY, 2010, 43 : 203 - 205
  • [37] Extracting Weighted Language Lexicons from Wikipedia
    Grefenstette, Gregory
    LREC 2016 - TENTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION, 2016, : 1365 - 1368
  • [38] Using Genetic Algorithms for the Inference of Motifs That Are Represented In Only a Subset of Sequences of Interest
    Thompson, Jeffrey A.
    Congdon, Clare Bates
    2011 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE WORKSHOPS, 2011, : 1005 - 1005
  • [39] MBMEDA: An Application of Estimation of Distribution Algorithms to the Problem of Finding Biological Motifs
    Jordan, Carlos I.
    Jordan, Carlos. J.
    ARTIFICIAL COMPUTATION IN BIOLOGY AND MEDICINE, PT I (IWINAC 2015), 2015, 9107 : 39 - 46
  • [40] Practical and efficient algorithms for degenerate and weighted sequences derived from high throughput sequencing technologies
    Antoniou, Pavlos
    Iliopoulos, Costas S.
    Mouchard, Laurent
    Pissis, Solon P.
    2009 INTERNATIONAL JOINT CONFERENCE ON BIOINFORMATICS, SYSTEMS BIOLOGY AND INTELLIGENT COMPUTING, PROCEEDINGS, 2009, : 174 - 180
12345