Laser method on-line

Karel Břinda 2013 Laser method on-line http://brinda.cz/laser-method/ Karel Břinda 2013 Lossless seeds for approximate string matching FNSPE Czech Technical University in Prague

Czech Republic

http://brinda.cz/publications/diplomka.pdf Stefan Burkhardt Juha Kärkkäinen 2001 Better Filtering with Gapped q-Grams Proceedings of the 12th Symposium on Combinatorial Pattern Matching (CPM) Lecture Notes in Computer Science 2089 Springer 73–85 10.1007/3-540-48194-X_6 Stefan Burkhardt Juha Kärkkäinen 2002 Better filtering with gapped q-grams Fundamenta Informaticae 56 1-2 51–70 Yangho Chen Tate Souaiaia Ting Chen 2009 PerM: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds Bioinformatics 25 19 2514–2521 10.1093/bioinformatics/btp486 Lavinia Egidi Giovanni Manzini 2011 Spaced Seeds Design Using Perfect Rulers Proceedings of the 18th International Symposium on String Processing and Information Retrieval (SPIRE), Pisa (Italy) Lecture Notes in Computer Science 7024 Springer 32–43 10.1007/978-3-642-24583-1_5 Lavinia Egidi Giovanni Manzini 2013 Better spaced seeds using quadratic residues Journal of Computer and System Sciences 79 7 1144–1155 10.1016/j.jcss.2013.03.002 Lavinia Egidi Giovanni Manzini 2014 Design and analysis of periodic multiple seeds Theoretical Computer Science 522 62–76 10.1016/j.tcs.2013.12.007 Lavinia Egidi Giovanni Manzini 2014 Spaced Seeds Design Using Perfect Rulers Fundamenta Informaticae 131 2 187–203 10.3233/FI-2014-1009 Martin Farach-Colton Gad M. Landau Süleyman Cenk Sahinalp Dekel Tsur 2007 Optimal spaced seeds for faster approximate string matching Journal of Computer and System Sciences 73 7 1035–1044 10.1016/j.jcss.2007.03.007 Gregory Kucherov Laurent Noé Mikhail A. Roytberg 2005 Multiseed lossless filtration IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) 2 1 51–61 10.1109/tcbb.2005.12 Heng Li Nils Homer 2010 A survey of sequence alignment algorithms for next-generation sequencing. Briefings in bioinformatics 11 5 473–83 10.1093/bib/bbq015 Hao Lin Zefeng Zhang Michael Q. Zhang Bin Ma Ming Li 2008 ZOOM! Zillions Of Oligos Mapped Bioinformatics 24 21 2431–2437 10.1093/bioinformatics/btn416 Douglas Lind Brian Marcus 1995 An Introduction to Symbolic Dynamics and Coding Cambridge University Press 10.1017/CBO9780511626302 M. Lothaire 1983 Combinatorics on Words Encyclopedia of Mathematics and its Applications 17 Addison-Wesley Publishing Co., Reading, Mass. 10.1017/CBO9780511566097 Reprinted in the Cambridge University Press, Cambridge, UK, 1997 Bin Ma John Tromp Ming Li 2002 PatternHunter: Faster and more sensitive homology search Bioinformatics 18 3 440–445 10.1093/bioinformatics/18.3.440 Saul B Needleman Christian D Wunsch 1970 A general method applicable to the search for similarities in the amino acid sequence of two proteins Journal of Molecular Biology 48 3 443–453 10.1016/0022-2836(70)90057-4 François Nicolas Éric Rivals 2005 Hardness of Optimal Spaced Seed Design A. Apostolico M. Crochemore K. Park Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching (CPM), Jeju Island (Korea) Lecture Notes in Computer Science 3537 Springer 144–155 10.1007/b137128 François Nicolas Éric Rivals 2008 Hardness of Optimal Spaced Seed Design Journal of Computer and System Sciences 74 5 831–849 10.1016/j.jcss.2007.10.001 Laurent Noé 2014 Spaced seeds bibliography http://www.lifl.fr/~noe/spaced_seeds.html Laurent Noé Gregory Kucherov 2005 YASS: enhancing the sensitivity of DNA similarity search Nucleic Acids Research 33 suppl. 2 W540–W543 10.1093/nar/gki478 Paolo Ribeca 2012 Short-Read Mapping Naiara Rodríguez-Ezpeleta Michael Hackenberg Ana M. Aransay Bioinformatics for High Throughput Sequencing Springer New York 107–125 10.1007/978-1-4614-0782-9_7 Temple F. Smith Michael S. Waterman 1981 Identification of common molecular subsequences. Journal of molecular biology 147 1 195–7 10.1016/0022-2836(81)90087-5