(Q48351380)

English

An efficient algorithm for finding short approximate non-tandem repeats.

scientific article published in January 2001

In more languages

edit

Statements

instance of

scholarly article

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

title

An efficient algorithm for finding short approximate non-tandem repeats. (English)

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

1 reference

Adebiyi EF

1

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

Jiang T

series ordinal

2

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

Kaufmann M

series ordinal

3

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

language of work or name

English

0 references

publication date

1 January 2001

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

published in

Bioinformatics

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

volume

17 Suppl 1

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

page(s)

S5-S12

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

Identifiers

DOI

10.1093/BIOINFORMATICS/17.SUPPL_1.S5

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

PubMed publication ID

11472987

1 reference

stated in

Europe PubMed Central

PubMed publication ID

11472987

retrieved

10 February 2018

reference URL

http://europepmc.org/abstract/MED/11472987

(Q48351380)

An efficient algorithm for finding short approximate non-tandem repeats.

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)