MyLibrary.bib 6.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102
  1. @article{prjibelski_using_2020,
  2. title = {Using {SPAdes} De Novo Assembler},
  3. volume = {70},
  4. issn = {1934-3396, 1934-340X},
  5. url = {https://onlinelibrary.wiley.com/doi/10.1002/cpbi.102},
  6. doi = {10.1002/cpbi.102},
  7. number = {1},
  8. journaltitle = {Current Protocols in Bioinformatics},
  9. shortjournal = {Current Protocols in Bioinformatics},
  10. author = {Prjibelski, Andrey and Antipov, Dmitry and Meleshko, Dmitry and Lapidus, Alla and Korobeynikov, Anton},
  11. urldate = {2021-05-26},
  12. date = {2020-06},
  13. langid = {english},
  14. }
  15. @article{li_fast_2009,
  16. title = {Fast and accurate short read alignment with Burrows-Wheeler transform},
  17. volume = {25},
  18. issn = {1367-4811},
  19. doi = {10.1093/bioinformatics/btp324},
  20. abstract = {{MOTIVATION}: The enormous amount of short reads generated by the new {DNA} sequencing technologies call for the development of fast and accurate read alignment programs. A first generation of hash table-based methods has been developed, including {MAQ}, which is accurate, feature rich and fast enough to align short reads from a single individual. However, {MAQ} does not support gapped alignment for single-end reads, which makes it unsuitable for alignment of longer reads where indels may occur frequently. The speed of {MAQ} is also a concern when the alignment is scaled up to the resequencing of hundreds of individuals.
  21. {RESULTS}: We implemented Burrows-Wheeler Alignment tool ({BWA}), a new read alignment package that is based on backward search with Burrows-Wheeler Transform ({BWT}), to efficiently align short sequencing reads against a large reference sequence such as the human genome, allowing mismatches and gaps. {BWA} supports both base space reads, e.g. from Illumina sequencing machines, and color space reads from {AB} {SOLiD} machines. Evaluations on both simulated and real data suggest that {BWA} is approximately 10-20x faster than {MAQ}, while achieving similar accuracy. In addition, {BWA} outputs alignment in the new standard {SAM} (Sequence Alignment/Map) format. Variant calling and other downstream analyses after the alignment can be achieved with the open source {SAMtools} software package.
  22. {AVAILABILITY}: http://maq.sourceforge.net.},
  23. pages = {1754--1760},
  24. number = {14},
  25. journaltitle = {Bioinformatics (Oxford, England)},
  26. shortjournal = {Bioinformatics},
  27. author = {Li, Heng and Durbin, Richard},
  28. date = {2009-07-15},
  29. pmid = {19451168},
  30. pmcid = {PMC2705234},
  31. keywords = {Algorithms, Genomics, Sequence Alignment, Sequence Analysis, {DNA}, Software},
  32. file = {Full Text:/home/thomas/Zotero/storage/RAZYFYCS/Li and Durbin - 2009 - Fast and accurate short read alignment with Burrow.pdf:application/pdf},
  33. }
  34. @article{altschul_basic_1990,
  35. title = {Basic local alignment search tool},
  36. volume = {215},
  37. issn = {0022-2836},
  38. doi = {10.1016/S0022-2836(05)80360-2},
  39. abstract = {A new approach to rapid sequence comparison, basic local alignment search tool ({BLAST}), directly approximates alignments that optimize a measure of local similarity, the maximal segment pair ({MSP}) score. Recent mathematical results on the stochastic properties of {MSP} scores allow an analysis of the performance of this method as well as the statistical significance of alignments it generates. The basic algorithm is simple and robust; it can be implemented in a number of ways and applied in a variety of contexts including straightforward {DNA} and protein sequence database searches, motif searches, gene identification searches, and in the analysis of multiple regions of similarity in long {DNA} sequences. In addition to its flexibility and tractability to mathematical analysis, {BLAST} is an order of magnitude faster than existing sequence comparison tools of comparable sensitivity.},
  40. pages = {403--410},
  41. number = {3},
  42. journaltitle = {Journal of Molecular Biology},
  43. shortjournal = {J Mol Biol},
  44. author = {Altschul, S. F. and Gish, W. and Miller, W. and Myers, E. W. and Lipman, D. J.},
  45. date = {1990-10-05},
  46. pmid = {2231712},
  47. keywords = {Algorithms, Software, Amino Acid Sequence, Base Sequence, Databases, Factual, Mutation, Sensitivity and Specificity, Sequence Homology, Nucleic Acid},
  48. }
  49. @article{quinlan_bedtools_2010,
  50. title = {{BEDTools}: a flexible suite of utilities for comparing genomic features},
  51. volume = {26},
  52. issn = {1460-2059, 1367-4803},
  53. url = {https://academic.oup.com/bioinformatics/article-lookup/doi/10.1093/bioinformatics/btq033},
  54. doi = {10.1093/bioinformatics/btq033},
  55. shorttitle = {{BEDTools}},
  56. pages = {841--842},
  57. number = {6},
  58. journaltitle = {Bioinformatics},
  59. author = {Quinlan, Aaron R. and Hall, Ira M.},
  60. urldate = {2021-05-26},
  61. date = {2010-03-15},
  62. langid = {english},
  63. file = {Full Text:/home/thomas/Zotero/storage/9QFL3W2J/Quinlan and Hall - 2010 - BEDTools a flexible suite of utilities for compar.pdf:application/pdf},
  64. }
  65. @article{chen_fastp_2018,
  66. title = {fastp: an ultra-fast all-in-one {FASTQ} preprocessor},
  67. volume = {34},
  68. issn = {1367-4803, 1460-2059},
  69. url = {https://academic.oup.com/bioinformatics/article/34/17/i884/5093234},
  70. doi = {10.1093/bioinformatics/bty560},
  71. shorttitle = {fastp},
  72. pages = {i884--i890},
  73. number = {17},
  74. journaltitle = {Bioinformatics},
  75. author = {Chen, Shifu and Zhou, Yanqing and Chen, Yaru and Gu, Jia},
  76. urldate = {2021-05-26},
  77. date = {2018-09-01},
  78. langid = {english},
  79. file = {Full Text:/home/thomas/Zotero/storage/6R62R2P4/Chen et al. - 2018 - fastp an ultra-fast all-in-one FASTQ preprocessor.pdf:application/pdf},
  80. }
  81. @article{faust_samblaster_2014,
  82. title = {{SAMBLASTER}: fast duplicate marking and structural variant read extraction},
  83. volume = {30},
  84. issn = {1367-4803, 1460-2059},
  85. url = {https://academic.oup.com/bioinformatics/article-lookup/doi/10.1093/bioinformatics/btu314},
  86. doi = {10.1093/bioinformatics/btu314},
  87. shorttitle = {{SAMBLASTER}},
  88. pages = {2503--2505},
  89. number = {17},
  90. journaltitle = {Bioinformatics},
  91. shortjournal = {Bioinformatics},
  92. author = {Faust, G. G. and Hall, I. M.},
  93. urldate = {2021-05-26},
  94. date = {2014-09-01},
  95. langid = {english},
  96. file = {Full Text:/home/thomas/Zotero/storage/5PRKXKZP/Faust and Hall - 2014 - SAMBLASTER fast duplicate marking and structural .pdf:application/pdf},
  97. }