Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings (bibtex)
by , , , , ,
Reference:
Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input StringsBojan Nikolic, Aleksandar Kartelj, Marko Djukanovic, Milana Grbic, Christian Blum, Günther RaidlMathematics, volume 9, number 13, 2021.
Bibtex Entry:
@article{nikolic-21,
AUTHOR = {Nikolic, Bojan and Kartelj, Aleksandar and Djukanovic, Marko and Grbic, Milana and Blum, Christian and Raidl, Günther},
TITLE = {Solving the Longest Common Subsequence Problem Concerning Non-Uniform Distributions of Letters in Input Strings},
JOURNAL = {Mathematics},
VOLUME = {9},
YEAR = {2021},
NUMBER = {13},
ARTICLE-NUMBER = {1515},
URL = {https://www.mdpi.com/2227-7390/9/13/1515},
DOI = {10.3390/math9131515}
}
Powered by bibtexbrowser