claim
active
claim:for-dna-database-search-it-is-usually-more-efficient-to-run-many-sequential-searches-in-parallel-than-to-parallelize-individual-searches

For DNA database search, it is usually more efficient to run many sequential searches in parallel than to parallelize individual searches.

Observation from practical experience with DNA sequence comparison.

Source paper

extracted_from
Artificial Intelligence and Linda in Context
(1989) · Carriero, Nicholas · Gelernter, David

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.