Editing Longest common subsequence (section)

=== Reduce cache misses ===
Chowdhury and Ramachandran devised a quadratic-time linear-space algorithm<ref name="CR-06" /><ref name="CLR-08">{{cite journal |last1=Chowdhury |first1=Rezaul |last2=Le |first2=Hai-Son |last3=Ramachandran |first3=Vijaya |title=Cache-oblivious dynamic programming for bioinformatics |journal=IEEE/ACM Transactions on Computational Biology and Bioinformatics |date=July 2010 |volume=7 |issue=3 |pages=495–510 |doi=10.1109/TCBB.2008.94 |pmid=20671320 |s2cid=2532039 |url=https://ieeexplore.ieee.org/document/4609376}}</ref> for finding the LCS length along with an optimal sequence which runs faster than Hirschberg's algorithm in practice due to its superior cache performance.<ref name="CR-06">{{cite book |last1=Chowdhury |first1=Rezaul |last2=Ramachandran |first2=Vijaya |title=Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 |chapter=Cache-oblivious dynamic programming |date=January 2006 |pages=591–600 |doi=10.1145/1109557.1109622 |isbn=0898716055 |s2cid=9650418 |chapter-url=https://dl.acm.org/doi/10.5555/1109557.1109622}}</ref> The algorithm has an asymptotically optimal cache complexity under the [[cache-oblivious#Idealized cache model|Ideal cache model]].<ref name="FLPR-12">{{cite journal |last1=Frigo |first1=Matteo |last2=Leiserson |first2=Charles E. |last3=Prokop |first3=Harald |last4=Ramachandran |first4=Sridhar |title=Cache-oblivious algorithms |journal=ACM Transactions on Algorithms |date=January 2012 |volume=8 |issue=1 |pages=1–22 |doi=10.1145/2071379.2071383 |url=https://dl.acm.org/doi/10.1145/2071379.2071383}}</ref> Interestingly, the algorithm itself is [[cache-oblivious]]<ref name="FLPR-12" /> meaning that it does not make any choices based on the cache parameters (e.g., cache size and cache line size) of the machine.