160 related articles for article (PubMed ID: 26547980)
1. A fast Boyer-Moore type pattern matching algorithm for highly similar sequences.
Ben Nsira N; Lecroq T; Elloumi M
Int J Data Min Bioinform; 2015; 13(3):266-88. PubMed ID: 26547980
[TBL] [Abstract][Full Text] [Related]
2. Compressed pattern matching in DNA sequences.
Chen L; Lu S; Ram J
Proc IEEE Comput Syst Bioinform Conf; 2004; ():62-8. PubMed ID: 16448000
[TBL] [Abstract][Full Text] [Related]
3. 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]
4. ABS: Sequence alignment by scanning.
Bonny T; Salama KN
Annu Int Conf IEEE Eng Med Biol Soc; 2011; 2011():928-31. PubMed ID: 22254463
[TBL] [Abstract][Full Text] [Related]
5. SIMD parallelization of the WORDUP algorithm for detecting statistically significant patterns in DNA sequences.
Liuni S; Prunella N; Pesole G; D'Orazio T; Stella E; Distante A
Comput Appl Biosci; 1993 Dec; 9(6):701-7. PubMed ID: 8143157
[TBL] [Abstract][Full Text] [Related]
6. Efficient algorithms and software for detection of full-length LTR retrotransposons.
Kalyanaraman A; Aluru S
Proc IEEE Comput Syst Bioinform Conf; 2005; ():56-64. PubMed ID: 16447962
[TBL] [Abstract][Full Text] [Related]
7. GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences.
Deusdado S; Carvalho P
Int J Bioinform Res Appl; 2009; 5(4):385-401. PubMed ID: 19640827
[TBL] [Abstract][Full Text] [Related]
8. Compression of Multiple DNA Sequences Using Intra-Sequence and Inter-Sequence Similarities.
Cheng KO; Wu P; Law NF; Siu WC
IEEE/ACM Trans Comput Biol Bioinform; 2015; 12(6):1322-32. PubMed ID: 26671804
[TBL] [Abstract][Full Text] [Related]
9. How does DNA sequence motif discovery work?
D'haeseleer P
Nat Biotechnol; 2006 Aug; 24(8):959-61. PubMed ID: 16900144
[No Abstract] [Full Text] [Related]
10. Segmentation algorithm for DNA sequences.
Zhang CT; Gao F; Zhang R
Phys Rev E Stat Nonlin Soft Matter Phys; 2005 Oct; 72(4 Pt 1):041917. PubMed ID: 16383430
[TBL] [Abstract][Full Text] [Related]
11. Sigma: multiple alignment of weakly-conserved non-coding DNA sequence.
Siddharthan R
BMC Bioinformatics; 2006 Mar; 7():143. PubMed ID: 16542424
[TBL] [Abstract][Full Text] [Related]
12. An index structure for pattern similarity searching in DNA microarray data.
Wang H; Perng CS; Fan W; Yu PS
Proc IEEE Comput Soc Bioinform Conf; 2002; 1():256-67. PubMed ID: 15838142
[TBL] [Abstract][Full Text] [Related]
13. Efficient filtering methods for clustering cDNAs with spliced sequence alignment.
Shibuya T; Kashima H; Konagaya A
Bioinformatics; 2004 Jan; 20(1):29-39. PubMed ID: 14693805
[TBL] [Abstract][Full Text] [Related]
14. Designing a bioengine for detection and analysis of base string on an affected sequence in high-concentration regions.
Bhattacharyya D; Mandal BK; Kim TH
Biomed Res Int; 2013; 2013():372646. PubMed ID: 24000321
[TBL] [Abstract][Full Text] [Related]
15. Sequence features of DNA binding sites reveal structural class of associated transcription factor.
Narlikar L; Hartemink AJ
Bioinformatics; 2006 Jan; 22(2):157-63. PubMed ID: 16267080
[TBL] [Abstract][Full Text] [Related]
16. SCOPE: a web server for practical de novo motif discovery.
Carlson JM; Chakravarty A; DeZiel CE; Gross RH
Nucleic Acids Res; 2007 Jul; 35(Web Server issue):W259-64. PubMed ID: 17485471
[TBL] [Abstract][Full Text] [Related]
17. rasbhari: Optimizing Spaced Seeds for Database Searching, Read Mapping and Alignment-Free Sequence Comparison.
Hahn L; Leimeister CA; Ounit R; Lonardi S; Morgenstern B
PLoS Comput Biol; 2016 Oct; 12(10):e1005107. PubMed ID: 27760124
[TBL] [Abstract][Full Text] [Related]
18. A profile-based deterministic sequential Monte Carlo algorithm for motif discovery.
Liang KC; Wang X; Anastassiou D
Bioinformatics; 2008 Jan; 24(1):46-55. PubMed ID: 18024972
[TBL] [Abstract][Full Text] [Related]
19. Pattern locator: a new tool for finding local sequence patterns in genomic DNA sequences.
Mrázek J; Xie S
Bioinformatics; 2006 Dec; 22(24):3099-100. PubMed ID: 17095514
[TBL] [Abstract][Full Text] [Related]
20. The generalised k-Truncated Suffix Tree for time-and space-efficient searches in multiple DNA or protein sequences.
Schulz MH; Bauer S; Robinson PN
Int J Bioinform Res Appl; 2008; 4(1):81-95. PubMed ID: 18283030
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
