109 related articles for article (PubMed ID: 22809415)
1. A bit-parallel dynamic programming algorithm suitable for DNA sequence alignment.
Kimura K; Koike A; Nakai K
J Bioinform Comput Biol; 2012 Aug; 10(4):1250002. PubMed ID: 22809415
[TBL] [Abstract][Full Text] [Related]
2. Bit-parallel sequence-to-graph alignment.
Rautiainen M; Mäkinen V; Marschall T
Bioinformatics; 2019 Oct; 35(19):3599-3607. PubMed ID: 30851095
[TBL] [Abstract][Full Text] [Related]
3. Large scale sequence alignment via efficient inference in generative models.
Mongia M; Shen C; Davoodi AG; Marçais G; Mohimani H
Sci Rep; 2023 May; 13(1):7285. PubMed ID: 37142645
[TBL] [Abstract][Full Text] [Related]
4. Shifted Hamming distance: a fast and accurate SIMD-friendly filter to accelerate alignment verification in read mapping.
Xin H; Greth J; Emmons J; Pekhimenko G; Kingsford C; Alkan C; Mutlu O
Bioinformatics; 2015 May; 31(10):1553-60. PubMed ID: 25577434
[TBL] [Abstract][Full Text] [Related]
5. libFLASM: a software library for fixed-length approximate string matching.
Ayad LA; Pissis SP; Retha A
BMC Bioinformatics; 2016 Nov; 17(1):454. PubMed ID: 27832739
[TBL] [Abstract][Full Text] [Related]
6. A short note on dynamic programming in a band.
Gibrat JF
BMC Bioinformatics; 2018 Jun; 19(1):226. PubMed ID: 29902968
[TBL] [Abstract][Full Text] [Related]
7. GATA: a graphic alignment tool for comparative sequence analysis.
Nix DA; Eisen MB
BMC Bioinformatics; 2005 Jan; 6():9. PubMed ID: 15655071
[TBL] [Abstract][Full Text] [Related]
8. libgapmis: extending short-read alignments.
Alachiotis N; Berger S; Flouri T; Pissis SP; Stamatakis A
BMC Bioinformatics; 2013; 14 Suppl 11(Suppl 11):S4. PubMed ID: 24564250
[TBL] [Abstract][Full Text] [Related]
9. A fast algorithm for determining the best combination of local alignments to a query sequence.
Conant GC; Wagner A
BMC Bioinformatics; 2004 May; 5():62. PubMed ID: 15149555
[TBL] [Abstract][Full Text] [Related]
10. On the Hardness of Sequence Alignment on De Bruijn Graphs.
Gibney D; Thankachan SV; Aluru S
J Comput Biol; 2022 Dec; 29(12):1377-1396. PubMed ID: 36450127
[TBL] [Abstract][Full Text] [Related]
11. An efficient algorithm for finding short approximate non-tandem repeats.
Adebiyi EF; Jiang T; Kaufmann M
Bioinformatics; 2001; 17 Suppl 1():S5-S12. PubMed ID: 11472987
[TBL] [Abstract][Full Text] [Related]
12. Hardware-Algorithm Codesign for Fast and Energy Efficient Approximate String Matching on FPGA for Computational Biology.
Gudur VY; Maheshwari S; Bhardwaj S; Acharyya A; Shafik R
Annu Int Conf IEEE Eng Med Biol Soc; 2022 Jul; 2022():87-90. PubMed ID: 36086088
[TBL] [Abstract][Full Text] [Related]
13. Computation of rank and select functions on hierarchical binary string and its application to genome mapping problems for short-read DNA sequences.
Kimura K; Suzuki Y; Sugano S; Koike A
J Comput Biol; 2009 Nov; 16(11):1601-13. PubMed ID: 19772398
[TBL] [Abstract][Full Text] [Related]
14. transAlign: using amino acids to facilitate the multiple alignment of protein-coding DNA sequences.
Bininda-Emonds OR
BMC Bioinformatics; 2005 Jun; 6():156. PubMed ID: 15969769
[TBL] [Abstract][Full Text] [Related]
15. An algorithm for progressive multiple alignment of sequences with insertions.
Löytynoja A; Goldman N
Proc Natl Acad Sci U S A; 2005 Jul; 102(30):10557-62. PubMed ID: 16000407
[TBL] [Abstract][Full Text] [Related]
16. Short read DNA fragment anchoring algorithm.
Wang W; Zhang P; Liu X
BMC Bioinformatics; 2009 Jan; 10 Suppl 1(Suppl 1):S17. PubMed ID: 19208116
[TBL] [Abstract][Full Text] [Related]
17. A local algorithm for DNA sequence alignment with inversions.
Schöniger M; Waterman MS
Bull Math Biol; 1992 Jul; 54(4):521-36. PubMed ID: 1591531
[TBL] [Abstract][Full Text] [Related]
18. YAHA: fast and flexible long-read alignment with optimal breakpoint detection.
Faust GG; Hall IM
Bioinformatics; 2012 Oct; 28(19):2417-24. PubMed ID: 22829624
[TBL] [Abstract][Full Text] [Related]
19. Error tolerant indexing and alignment of short reads with covering template families.
Giladi E; Healy J; Myers G; Hart C; Kapranov P; Lipson D; Roels S; Thayer E; Letovsky S
J Comput Biol; 2010 Oct; 17(10):1397-1411. PubMed ID: 20937014
[TBL] [Abstract][Full Text] [Related]
20. An efficient alignment algorithm for searching simple pseudoknots over long genomic sequence.
Ma C; Wong TK; Lam TW; Hon WK; Sadakane K; Yiu SM
IEEE/ACM Trans Comput Biol Bioinform; 2012; 9(6):1629-38. PubMed ID: 22848134
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
