claim
active
claim:for-dna-database-search-it-is-usually-more-efficient-to-run-many-sequential-searches-in-parallel-than-to-parallelize-individual-searchesFor 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(1989) · Carriero, Nicholas · Gelernter, David
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- A combinatorial argument that good sequences are astronomically rare, emphasizing the difficulty of discovery.
- Main functional claim about MCA.
- Second central claim of the paper.
- Subclaim.
- Empirical observation that a relational engine is too slow for associative lookup, motivating specialized implementation.
- Basis for preferring Linda's out (asynchronous) to remote procedure calls.
- Describes the dual process of complexity buildup and simplification, leading to the beauty of primitive art and nature.