Problema de subsecuencia común más larga (Spanish Wikipedia)

Analysis of information sources in references of the Wikipedia article "Problema de subsecuencia común más larga" in Spanish language version.

refsWebsite

Global rank Spanish rank

8doi.org

2^nd place

5ams.org

451^st place

1,294^th place

1arxiv.org

69^th place

148^th place

1archive.org

6^th place

5^th place

1books.google.com

3^rd place

7^th place

1bgu.ac.il

low place

ams.org (Global: 451^st place; Spanish: 1,294^th place)

Masek, William J.; Paterson, Michael S. (1980), «A faster algorithm computing string edit distances», Journal of Computer and System Sciences 20 (1): 18-31, MR 566639, doi:10.1016/0022-0000(80)90002-1 ..
Chvatal, Václáv; Sankoff, David (1975), «Longest common subsequences of two random sequences», Journal of Applied Probability 12: 306-315, MR 0405531, doi:10.2307/3212444 ..
Lueker, George S. (2009), «Improved bounds on the average length of longest common subsequences», Journal of the ACM 56 (3), A17, MR 2536132, doi:10.1145/1516512.1516519 ..
Kiwi, Marcos; Loebl, Martin; Matoušek, Jiří (2005), «Expected length of the longest common subsequence for large alphabets», Advances in Mathematics 197 (2): 480-498, MR 2173842, doi:10.1016/j.aim.2004.10.012 ..
Majumdar, Satya N.; Nechaev, Sergei (2005), «Exact asymptotic results for the Bernoulli matching model of sequence alignment», Physical Review E 72 (2): 020901, 4, MR 2177365, doi:10.1103/PhysRevE.72.020901 ..

archive.org (Global: 6^th place; Spanish: 5^th place)

Xia, Xuhua (2007). Bioinformatics and the Cell: Modern Computational Approaches in Genomics, Proteomics and Transcriptomics. Nueva York: Springer. p. 24. ISBN 0-387-71336-0.

arxiv.org (Global: 69^th place; Spanish: 148^th place)

Ronald I. Greenberg (6 de agosto de 2003). «Bounds on the Number of Longest Common Subsequences». arXiv:cs.DM/0301030.

bgu.ac.il (Global: low place; Spanish: low place)

cs.bgu.ac.il

http://www.cs.bgu.ac.il/~dpaa111/wiki.files/HuntSzymanski.pdf

books.google.com (Global: 3^rd place; Spanish: 7^th place)

http://books.google.com/books?id=mFd_grFyiT4C&pg=PA132&lpg=PA132&dq=hunt+szymanski+algorithm&source=bl&ots=sMc-HtvNTQ&sig=FtrZ_b5JdJ25Ighwc1-XOfysaf8&hl=en&sa=X&ei=-BU9VPK7OpS7ggT0gYEQ&ved=0CDsQ6AEwAw#v=onepage&q&f=false

doi.org (Global: 2^nd place; Spanish: 2^nd place)

dx.doi.org

David Maier (1978). «The Complexity of Some Problems on Subsequences and Supersequences». J. ACM (ACM Press) 25 (2): 322-336. doi:10.1145/322063.322075.
L. Bergroth and H. Hakonen and T. Raita (2000). «A Survey of Longest Common Subsequence Algorithms». SPIRE (IEEE Computer Society) 00: 39-48. ISBN 0-7695-0746-8. doi:10.1109/SPIRE.2000.878178.
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.
Masek, William J.; Paterson, Michael S. (1980), «A faster algorithm computing string edit distances», Journal of Computer and System Sciences 20 (1): 18-31, MR 566639, doi:10.1016/0022-0000(80)90002-1 ..
Chvatal, Václáv; Sankoff, David (1975), «Longest common subsequences of two random sequences», Journal of Applied Probability 12: 306-315, MR 0405531, doi:10.2307/3212444 ..
Lueker, George S. (2009), «Improved bounds on the average length of longest common subsequences», Journal of the ACM 56 (3), A17, MR 2536132, doi:10.1145/1516512.1516519 ..
Kiwi, Marcos; Loebl, Martin; Matoušek, Jiří (2005), «Expected length of the longest common subsequence for large alphabets», Advances in Mathematics 197 (2): 480-498, MR 2173842, doi:10.1016/j.aim.2004.10.012 ..
Majumdar, Satya N.; Nechaev, Sergei (2005), «Exact asymptotic results for the Bernoulli matching model of sequence alignment», Physical Review E 72 (2): 020901, 4, MR 2177365, doi:10.1103/PhysRevE.72.020901 ..

Problema de subsecuencia común más larga (Spanish Wikipedia)

ams.org (Global: 451st place; Spanish: 1,294th place)

archive.org (Global: 6th place; Spanish: 5th place)

arxiv.org (Global: 69th place; Spanish: 148th place)