Closest string (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Closest string" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

451^st place

277^th place

5,491^st place

3,397^th place

low place

low place

69^th place

59^th place

207^th place

136^th place

ams.org

mathscinet.ams.org

Lanctot, J. Kevin; Li, Ming; Ma, Bin; Wang, Shaojiu; Zhang, Louxin (2003), "Distinguishing string selection problems", Information and Computation, 185 (1): 41–55, doi:10.1016/S0890-5401(03)00057-9, MR 1994748

arxiv.org

M. Li; B. Ma; L. Wang. (2002), "On the Closest String and Substring Problems." (PDF), Journal of the ACM, 49 (2): 157–171, arXiv:cs/0002012, doi:10.1145/506147.506150, S2CID 965332

cityu.edu.hk

cs.cityu.edu.hk

M. Li; B. Ma; L. Wang. (2002), "On the Closest String and Substring Problems." (PDF), Journal of the ACM, 49 (2): 157–171, arXiv:cs/0002012, doi:10.1145/506147.506150, S2CID 965332

doi.org

Lanctot, J. Kevin; Li, Ming; Ma, Bin; Wang, Shaojiu; Zhang, Louxin (2003), "Distinguishing string selection problems", Information and Computation, 185 (1): 41–55, doi:10.1016/S0890-5401(03)00057-9, MR 1994748
Bin Ma; Xiaming Sun (2008). "More Efficient Algorithms for Closest String and Substring Problems" (PDF). Research in Computational Molecular Biology. 12th Ann. Int. Conf. on Research in Computational Molecular Biology (RECOMB). LNCS. Vol. 4955. Springer. pp. 396–409. doi:10.1007/978-3-540-78839-3_33. ISBN 978-3-540-78838-6.
M. Li; B. Ma; L. Wang. (2002), "On the Closest String and Substring Problems." (PDF), Journal of the ACM, 49 (2): 157–171, arXiv:cs/0002012, doi:10.1145/506147.506150, S2CID 965332
Jens Gramm; Rolf Niedermeier; Peter Rossmanith (2003), "Fixed-Parameter Algorithms for Closest String and Related Problems", Algorithmica, 37: 25–42, CiteSeerX 10.1.1.61.736, doi:10.1007/s00453-003-1028-3, S2CID 8206021

psu.edu

citeseerx.ist.psu.edu

Jens Gramm; Rolf Niedermeier; Peter Rossmanith (2003), "Fixed-Parameter Algorithms for Closest String and Related Problems", Algorithmica, 37: 25–42, CiteSeerX 10.1.1.61.736, doi:10.1007/s00453-003-1028-3, S2CID 8206021

semanticscholar.org

api.semanticscholar.org

M. Li; B. Ma; L. Wang. (2002), "On the Closest String and Substring Problems." (PDF), Journal of the ACM, 49 (2): 157–171, arXiv:cs/0002012, doi:10.1145/506147.506150, S2CID 965332
Jens Gramm; Rolf Niedermeier; Peter Rossmanith (2003), "Fixed-Parameter Algorithms for Closest String and Related Problems", Algorithmica, 37: 25–42, CiteSeerX 10.1.1.61.736, doi:10.1007/s00453-003-1028-3, S2CID 8206021

uwo.ca

csd.uwo.ca

Bin Ma; Xiaming Sun (2008). "More Efficient Algorithms for Closest String and Substring Problems" (PDF). Research in Computational Molecular Biology. 12th Ann. Int. Conf. on Research in Computational Molecular Biology (RECOMB). LNCS. Vol. 4955. Springer. pp. 396–409. doi:10.1007/978-3-540-78839-3_33. ISBN 978-3-540-78838-6.