Unverified50% confidenceFactExact time
The Needleman-Wunsch global sequence alignment algorithm (1970) and the Smith-Waterman local alignment algorithm (1981) belong to the same algorithm family as edit distance, sharing the same dynamic programming framework.
1
Sources
50%
Confidence
Long-term
Relevance
8/11/2026
First Seen
Sources
Related Claims
Unverified计算编辑距离的经典动态规划算法由 Wagner 和 Fischer 于 1974 年提出，时间复杂度为 O(m×n)58% similarUnverifiedFloyd-Steinberg抖动算法发表于1976年，通过误差扩散机制将每个像素的量化误差按权重分配给相邻像素58% similarUnverified力导向布局的经典实现包括Fruchterman-Reingold算法（1991年）和Kamada-Kawai算法（1989年），朴素实现复杂度为O(n²)每次迭代56% similarUnverifiedThe theoretical foundation of the minimax algorithm can be traced back to von Neumann's minimax theorem of 1928.56% similarUnverified约束传播的思想最早可追溯至1970年代阿兰·马克沃斯对弧一致性算法的研究56% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/732506API
curl https://kongchang.com/api/v1/knowledge/claims/732506MCP
get_claim(id=732506)