TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Using Suffix Trees to Detect Homology at Scale

30 pointsby r4umover 1 year ago

2 comments

fastaguy88over 1 year ago
It is critical to understand that this article fundamentally misuses the word &quot;homology&quot;, which in bioinformatics and molecular evolution is understood to mean &quot;sharing a common ancestor&quot;. Similarity searches (typically using programs like BLAST, one of the most cited methods in the biomedical literature) look for homologs.<p>This article is NOT about &quot;homology&quot; detection (which suffix trees are not particularly good for), it is about &quot;identity&quot; detection (which is a related problem, but fundamentally different). It is unfortunate that in the biomedical literature, the word &quot;homology&quot; is often misused in place of &quot;identity&quot; (as in &quot;micro-homology&quot;, which is really &quot;micro-identity&quot;), but serious computational biologists try to avoid this misuse of the word &quot;homology&quot;.
评论 #38063630 未加载
jakobnissenover 1 year ago
There is a rich literature in bioinformatics on sequence homology search, and there are many existing libraries that scale to billions on base pairs. I wonder why they reinvented the wheel
评论 #38060808 未加载
评论 #38060851 未加载
评论 #38061041 未加载
评论 #38060750 未加载