83 related articles for article (PubMed ID: 7497117)
1. Method for calculation of probability of matching a bounded regular expression in a random data string.
Sewell RF; Durbin R
J Comput Biol; 1995; 2(1):25-31. PubMed ID: 7497117
[TBL] [Abstract][Full Text] [Related]
2. Calculating the exact probability of language-like patterns in biomolecular sequences.
Atteson K
Proc Int Conf Intell Syst Mol Biol; 1998; 6():17-24. PubMed ID: 9783205
[TBL] [Abstract][Full Text] [Related]
3. Pattern matching between two non-aligned random sequences.
Sheng KN; Naus JI
Bull Math Biol; 1994 Nov; 56(6):1143-62. PubMed ID: 7833847
[TBL] [Abstract][Full Text] [Related]
4. Neweyes: a system for comparing biological sequences using the running Karp-Rabin Greedy String-Tiling algorithm.
Wise MJ
Proc Int Conf Intell Syst Mol Biol; 1995; 3():393-401. PubMed ID: 7584464
[TBL] [Abstract][Full Text] [Related]
5. Maximum A posteriori classification of DNA structure from sequence information.
Loewenstern DM; Berman HM; Hirsh H
Pac Symp Biocomput; 1998; ():669-80. PubMed ID: 9697221
[TBL] [Abstract][Full Text] [Related]
6. Fast and simple character classes and bounded gaps pattern matching, with applications to protein searching.
Navarro G; Raffinot M
J Comput Biol; 2003; 10(6):903-23. PubMed ID: 14980017
[TBL] [Abstract][Full Text] [Related]
7. FASTPAT: a fast and efficient algorithm for string searching in DNA sequences.
Prunella N; Liuni S; Attimonelli M; Pesole G
Comput Appl Biosci; 1993 Oct; 9(5):541-5. PubMed ID: 8293327
[TBL] [Abstract][Full Text] [Related]
8. The 3of5 web application for complex and comprehensive pattern matching in protein sequences.
Seiler M; Mehrle A; Poustka A; Wiemann S
BMC Bioinformatics; 2006 Mar; 7():144. PubMed ID: 16542452
[TBL] [Abstract][Full Text] [Related]
9. Algorithms for protein structural motif recognition.
Berger B
J Comput Biol; 1995; 2(1):125-38. PubMed ID: 7497115
[TBL] [Abstract][Full Text] [Related]
10. Computational techniques and pattern recognition: pattern discovery in bioinformatics.
Rajapakse J
IEEE Eng Med Biol Mag; 2009; 28(4):16-8. PubMed ID: 19622419
[No Abstract] [Full Text] [Related]
11. Local alignment statistics.
Altschul SF; Gish W
Methods Enzymol; 1996; 266():460-80. PubMed ID: 8743700
[No Abstract] [Full Text] [Related]
12. The value of prior knowledge in discovering motifs with MEME.
Bailey TL; Elkan C
Proc Int Conf Intell Syst Mol Biol; 1995; 3():21-9. PubMed ID: 7584439
[TBL] [Abstract][Full Text] [Related]
13. Matching among multiple random sequences.
Naus JI; Sheng KN
Bull Math Biol; 1997 May; 59(3):483-96. PubMed ID: 9172825
[TBL] [Abstract][Full Text] [Related]
14. Finding flexible patterns in unaligned protein sequences.
Jonassen I; Collins JF; Higgins DG
Protein Sci; 1995 Aug; 4(8):1587-95. PubMed ID: 8520485
[TBL] [Abstract][Full Text] [Related]
15. PROSITE: recent developments.
Bairoch A; Bucher P
Nucleic Acids Res; 1994 Sep; 22(17):3583-9. PubMed ID: 7937064
[TBL] [Abstract][Full Text] [Related]
16. Approximate matching of network expressions with spacers.
Myers EW
J Comput Biol; 1996; 3(1):33-51. PubMed ID: 8697238
[TBL] [Abstract][Full Text] [Related]
17. Approximate string matching using phase correlation.
Alba A; Rodriguez-Kessler M; Arce-Santana ER; Mendez MO
Annu Int Conf IEEE Eng Med Biol Soc; 2012; 2012():6309-12. PubMed ID: 23367371
[TBL] [Abstract][Full Text] [Related]
18. High performance pattern matching on heterogeneous platform.
Soroushnia S; Daneshtalab M; Plosila J; Pahikkala T; Liljeberg P
J Integr Bioinform; 2014 Oct; 11(3):253. PubMed ID: 25339087
[TBL] [Abstract][Full Text] [Related]
19. On approximate string matching of unique oligonucleotides.
Hyyrö H; Vihinen M; Juhola M
Stud Health Technol Inform; 2001; 84(Pt 2):960-4. PubMed ID: 11604874
[TBL] [Abstract][Full Text] [Related]
20. A design of a parallel architecture for solving exact matching problem on DNA molecules.
Khaled H; Faheem HM; Hasan T; Ghoneimy S
Biomed Sci Instrum; 2007; 43():170-5. PubMed ID: 17487076
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
