133 related articles for article (PubMed ID: 30951368)
1. Using Multiple Fickett Bands to Accelerate Biological Sequence Comparisons.
Silva GHG; Sandes EFO; Teodoro G; Melo ACMA
J Comput Biol; 2019 Sep; 26(9):908-922. PubMed ID: 30951368
[No Abstract] [Full Text] [Related]
2. Efficient Computation of Longest Common Subsequences with Multiple Substring Inclusive Constraints.
Wang X; Wang L; Zhu D
J Comput Biol; 2019 Sep; 26(9):938-947. PubMed ID: 30958704
[No Abstract] [Full Text] [Related]
3. A space-efficient algorithm for the constrained pairwise sequence alignment problem.
He D; Arslan AN
Genome Inform; 2005; 16(2):237-46. PubMed ID: 16901106
[TBL] [Abstract][Full Text] [Related]
4. A fast parallel algorithm for finding the longest common sequence of multiple biosequences.
Chen Y; Wan A; Liu W
BMC Bioinformatics; 2006 Dec; 7 Suppl 4(Suppl 4):S4. PubMed ID: 17217522
[TBL] [Abstract][Full Text] [Related]
5. A memory-efficient algorithm for multiple sequence alignment with constraints.
Lu CL; Huang YP
Bioinformatics; 2005 Jan; 21(1):20-30. PubMed ID: 15374876
[TBL] [Abstract][Full Text] [Related]
6. DCA: an efficient implementation of the divide-and-conquer approach to simultaneous multiple sequence alignment.
Stoye J; Moulton V; Dress AW
Comput Appl Biosci; 1997 Dec; 13(6):625-6. PubMed ID: 9475994
[TBL] [Abstract][Full Text] [Related]
7. Parallel Tiled Codes Implementing the Smith-Waterman Alignment Algorithm for Two and Three Sequences.
Palkowski M; Bielecki W
J Comput Biol; 2018 Oct; 25(10):1106-1119. PubMed ID: 29993269
[TBL] [Abstract][Full Text] [Related]
8. Interactive software tool to comprehend the calculation of optimal sequence alignments with dynamic programming.
Ibarra IL; Melo F
Bioinformatics; 2010 Jul; 26(13):1664-5. PubMed ID: 20472540
[TBL] [Abstract][Full Text] [Related]
9. Multiple sequence alignment with the Divide-and-Conquer method.
Stoye J
Gene; 1998 May; 211(2):GC45-56. PubMed ID: 9669886
[TBL] [Abstract][Full Text] [Related]
10. Dynamic programming.
Nalbantoğlu ÖU
Methods Mol Biol; 2014; 1079():3-27. PubMed ID: 24170392
[TBL] [Abstract][Full Text] [Related]
11. Finite width model sequence comparison.
Chia N; Bundschuh R
Phys Rev E Stat Nonlin Soft Matter Phys; 2004 Aug; 70(2 Pt 1):021906. PubMed ID: 15447514
[TBL] [Abstract][Full Text] [Related]
12. A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure.
Eddy SR
BMC Bioinformatics; 2002 Jul; 3():18. PubMed ID: 12095421
[TBL] [Abstract][Full Text] [Related]
13. An iterative method for faster sum-of-pairs multiple sequence alignment.
Reinert K; Stoye J; Will T
Bioinformatics; 2000 Sep; 16(9):808-14. PubMed ID: 11108703
[TBL] [Abstract][Full Text] [Related]
14. An OpenMP-based tool for finding longest common subsequence in bioinformatics.
Shikder R; Thulasiraman P; Irani P; Hu P
BMC Res Notes; 2019 Apr; 12(1):220. PubMed ID: 30971295
[TBL] [Abstract][Full Text] [Related]
15. Accelerating the Smith-Waterman algorithm with interpair pruning and band optimization for the all-pairs comparison of base sequences.
Okada D; Ino F; Hagihara K
BMC Bioinformatics; 2015 Oct; 16():321. PubMed ID: 26445214
[TBL] [Abstract][Full Text] [Related]
16. Cache-oblivious dynamic programming for bioinformatics.
Chowdhury RA; Le HS; Ramachandran V
IEEE/ACM Trans Comput Biol Bioinform; 2010; 7(3):495-510. PubMed ID: 20671320
[TBL] [Abstract][Full Text] [Related]
17. Parallel progressive multiple sequence alignment on reconfigurable meshes.
Nguyen KD; Pan Y; Nong G
BMC Genomics; 2011 Dec; 12 Suppl 5(Suppl 5):S4. PubMed ID: 22369070
[TBL] [Abstract][Full Text] [Related]
18. A fast and memory efficient MLCS algorithm by character merging for DNA sequences alignment.
Liu S; Wang Y; Tong W; Wei S
Bioinformatics; 2020 Feb; 36(4):1066-1073. PubMed ID: 31584616
[TBL] [Abstract][Full Text] [Related]
19. A genetic algorithm for multiple molecular sequence alignment.
Zhang C; Wong AK
Comput Appl Biosci; 1997 Dec; 13(6):565-81. PubMed ID: 9475984
[TBL] [Abstract][Full Text] [Related]
20. Encoded expansion: an efficient algorithm to discover identical string motifs.
Azmi AM; Al-Ssulami A
PLoS One; 2014; 9(5):e95148. PubMed ID: 24871320
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
