Sign In

Login

Password

Forgot Password ? Sign Up

Longest common subsequence (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Longest common subsequence" in English language version.

refsWebsite
Global rank English rank
12doi.org
2nd place
2nd place
9semanticscholar.org
11th place
8th place
5ams.org
451st place
277th place
3arxiv.org
69th place
59th place
2acm.org
1,185th place
840th place
2nih.gov
4th place
4th place
1psu.edu
207th place
136th place
1archive.org
6th place
6th place
1ieee.org
652nd place
515th place
1books.google.com
3rd place
3rd place
1jstor.org
26th place
20th place
1harvard.edu
18th place
17th place

acm.org

dl.acm.org

ams.org

mathscinet.ams.org

archive.org

arxiv.org

books.google.com

doi.org

harvard.edu

ui.adsabs.harvard.edu

ieee.org

ieeexplore.ieee.org

jstor.org

nih.gov

pubmed.ncbi.nlm.nih.gov

psu.edu

citeseerx.ist.psu.edu

semanticscholar.org

api.semanticscholar.org

  • David Maier (1978). "The Complexity of Some Problems on Subsequences and Supersequences". J. ACM. 25 (2). ACM Press: 322–336. doi:10.1145/322063.322075. S2CID 16120634.
  • Wagner, Robert; Fischer, Michael (January 1974). "The string-to-string correction problem". Journal of the ACM. 21 (1): 168–173. CiteSeerX 10.1.1.367.5281. doi:10.1145/321796.321811. S2CID 13381535.
  • L. Bergroth and H. Hakonen and T. Raita (7–29 September 2000). A survey of longest common subsequence algorithms. Proceedings Seventh International Symposium on String Processing and Information Retrieval. SPIRE 2000. A Curuna, Spain: IEEE Computer Society. pp. 39–48. doi:10.1109/SPIRE.2000.878178. ISBN 0-7695-0746-8. S2CID 10375334.
  • Hirschberg, D. S. (1975). "A linear space algorithm for computing maximal common subsequences". Communications of the ACM. 18 (6): 341–343. doi:10.1145/360825.360861. S2CID 207694727.
  • Chowdhury, Rezaul; Ramachandran, Vijaya (January 2006). "Cache-oblivious dynamic programming". Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06. pp. 591–600. doi:10.1145/1109557.1109622. ISBN 0898716055. S2CID 9650418.
  • Chowdhury, Rezaul; Le, Hai-Son; Ramachandran, Vijaya (July 2010). "Cache-oblivious dynamic programming for bioinformatics". IEEE/ACM Transactions on Computational Biology and Bioinformatics. 7 (3): 495–510. doi:10.1109/TCBB.2008.94. PMID 20671320. S2CID 2532039.
  • Chvátal, Václáv; Sankoff, David (1975), "Longest common subsequences of two random sequences", Journal of Applied Probability, 12 (2): 306–315, doi:10.2307/3212444, JSTOR 3212444, MR 0405531, S2CID 250345191.
  • Lueker, George S. (2009), "Improved bounds on the average length of longest common subsequences", Journal of the ACM, 56 (3), A17, doi:10.1145/1516512.1516519, MR 2536132, S2CID 7232681.
  • Majumdar, Satya N.; Nechaev, Sergei (2005), "Exact asymptotic results for the Bernoulli matching model of sequence alignment", Physical Review E, 72 (2): 020901, 4, arXiv:q-bio/0410012, Bibcode:2005PhRvE..72b0901M, doi:10.1103/PhysRevE.72.020901, MR 2177365, PMID 16196539, S2CID 11390762.