<html><head><meta http-equiv="content-type" content="text/html; charset=utf-8"></head><body dir="auto"><div dir="ltr"></div><div dir="ltr"><br><br></div><blockquote type="cite"><div dir="ltr"><b>From:</b> Olin Johnson <olinlj@icloud.com><br><b>Date:</b> April 15, 2023 at 9:37:26 AM EDT<br><b>To:</b> Peter Cock <p.j.a.cock@googlemail.com><br><b>Subject:</b> <b>Re: [Biopython] New Feature Idea</b><br><br></div></blockquote><blockquote type="cite"><div dir="ltr"><span>Hey Peter,</span><br><span></span><br><span>Thanks for your email - I checked out the RapidFuzz library you linked, which looks great for string comparisons, so I’d definitely agree with your assessment that a Biopython implementation isn’t really necessary. Thanks for the recommendation.</span><br><span></span><br><span>Best,</span><br><span>Olin</span><br><span></span><br><blockquote type="cite"><span>On Apr 6, 2023, at 4:12 AM, Peter Cock <p.j.a.cock@googlemail.com> wrote:</span><br></blockquote><blockquote type="cite"><span></span><br></blockquote><blockquote type="cite"><span>Hello Olin,</span><br></blockquote><blockquote type="cite"><span></span><br></blockquote><blockquote type="cite"><span>I can recommend the RapidFuzz library which has various high</span><br></blockquote><blockquote type="cite"><span>performance implementations of string comparisons, including the</span><br></blockquote><blockquote type="cite"><span>Hamming distance. I use this for the Levenshtein distance.</span><br></blockquote><blockquote type="cite"><span></span><br></blockquote><blockquote type="cite"><span>https://maxbachmann.github.io/RapidFuzz/index.html</span><br></blockquote><blockquote type="cite"><span>https://github.com/maxbachmann/RapidFuzz</span><br></blockquote><blockquote type="cite"><span>https://doi.org/10.5281/zenodo.5228985</span><br></blockquote><blockquote type="cite"><span></span><br></blockquote><blockquote type="cite"><span>I don't see that adding our own implementation to Biopython adds much?</span><br></blockquote><blockquote type="cite"><span></span><br></blockquote><blockquote type="cite"><span>Peter</span><br></blockquote><blockquote type="cite"><span></span><br></blockquote><blockquote type="cite"><span>On Thu, Apr 6, 2023 at 3:34 AM Olin Johnson <olinlj@icloud.com> wrote:</span><br></blockquote><blockquote type="cite"><blockquote type="cite"><span></span><br></blockquote></blockquote><blockquote type="cite"><blockquote type="cite"><span>Howdy!</span><br></blockquote></blockquote><blockquote type="cite"><blockquote type="cite"><span></span><br></blockquote></blockquote><blockquote type="cite"><blockquote type="cite"><span>I’m Olin, and I’m interested in contributing to Biopython. While using Biopython, I had the thought that it might be useful to implement a method that calculates the hamming distance between two DNA sequences. This could be useful for quickly finding mutations. Wondering if this would be a good feature to implement.</span><br></blockquote></blockquote><blockquote type="cite"><blockquote type="cite"><span>_______________________________________________</span><br></blockquote></blockquote><blockquote type="cite"><blockquote type="cite"><span>Biopython mailing list - Biopython@biopython.org</span><br></blockquote></blockquote><blockquote type="cite"><blockquote type="cite"><span>https://mailman.open-bio.org/mailman/listinfo/biopython</span><br></blockquote></blockquote><span></span><br><span></span><br></div></blockquote></body></html>