187 related articles for article (PubMed ID: 15826353)
1. The many faces of sequence alignment.
Batzoglou S
Brief Bioinform; 2005 Mar; 6(1):6-22. PubMed ID: 15826353
[TBL] [Abstract][Full Text] [Related]
2. A tutorial of recent developments in the seeding of local alignment.
Brown DG; Li M; Ma B
J Bioinform Comput Biol; 2004 Dec; 2(4):819-42. PubMed ID: 15617167
[TBL] [Abstract][Full Text] [Related]
3. Using guide trees to construct multiple-sequence evolutionary HMMs.
Holmes I
Bioinformatics; 2003; 19 Suppl 1():i147-57. PubMed ID: 12855451
[TBL] [Abstract][Full Text] [Related]
4. Multiple sequence alignment using an exhaustive and greedy algorithm.
Wang Y; Li KB
J Bioinform Comput Biol; 2005 Apr; 3(2):243-55. PubMed ID: 15852503
[TBL] [Abstract][Full Text] [Related]
5. Multiple sequence alignment with arbitrary gap costs: computing an optimal solution using polyhedral combinatorics.
Althaus E; Caprara A; Lenhof HP; Reinert K
Bioinformatics; 2002; 18 Suppl 2():S4-S16. PubMed ID: 12385977
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. 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]
8. 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]
9. MORPH: probabilistic alignment combined with hidden Markov models of cis-regulatory modules.
Sinha S; He X
PLoS Comput Biol; 2007 Nov; 3(11):e216. PubMed ID: 17997594
[TBL] [Abstract][Full Text] [Related]
10. Accuracy of structure-based sequence alignment of automatic methods.
Kim C; Lee B
BMC Bioinformatics; 2007 Sep; 8():355. PubMed ID: 17883866
[TBL] [Abstract][Full Text] [Related]
11. An efficient algorithm for optimizing whole genome alignment with noise.
Wong PW; Lam TW; Lu N; Ting HF; Yiu SM
Bioinformatics; 2004 Nov; 20(16):2676-84. PubMed ID: 15145812
[TBL] [Abstract][Full Text] [Related]
12. Recent developments in the MAFFT multiple sequence alignment program.
Katoh K; Toh H
Brief Bioinform; 2008 Jul; 9(4):286-98. PubMed ID: 18372315
[TBL] [Abstract][Full Text] [Related]
13. Identifying multiple alignment regions satisfying simple formulas and patterns.
Stojanovic N; Dewar K
Bioinformatics; 2004 Sep; 20(13):2140-2. PubMed ID: 15044226
[TBL] [Abstract][Full Text] [Related]
14. Application of protein structure alignments to iterated hidden Markov model protocols for structure prediction.
Scheeff ED; Bourne PE
BMC Bioinformatics; 2006 Sep; 7():410. PubMed ID: 16970830
[TBL] [Abstract][Full Text] [Related]
15. 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]
16. APDB: a novel measure for benchmarking sequence alignment methods without reference alignments.
O'Sullivan O; Zehnder M; Higgins D; Bucher P; Grosdidier A; Notredame C
Bioinformatics; 2003; 19 Suppl 1():i215-21. PubMed ID: 12855461
[TBL] [Abstract][Full Text] [Related]
17. Learning scoring schemes for sequence alignment from partial examples.
Kim E; Kececioglu J
IEEE/ACM Trans Comput Biol Bioinform; 2008; 5(4):546-56. PubMed ID: 18989042
[TBL] [Abstract][Full Text] [Related]
18. Kalign--an accurate and fast multiple sequence alignment algorithm.
Lassmann T; Sonnhammer EL
BMC Bioinformatics; 2005 Dec; 6():298. PubMed ID: 16343337
[TBL] [Abstract][Full Text] [Related]
19. Introduction to comparing large sequence sets.
Page RD
Curr Protoc Bioinformatics; 2003 Feb; Chapter 10():Unit 10.1. PubMed ID: 18428691
[TBL] [Abstract][Full Text] [Related]
20. Fast and accurate probe selection algorithm for large genomes.
Sung WK; Lee WH
Proc IEEE Comput Soc Bioinform Conf; 2003; 2():65-74. PubMed ID: 16452780
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
