Abstract: Embodiments include partitioning queries into subsets of queries and at least one database into subdatabases, designating searching tasks by associating each of the subsets of queries with one or more of the subdatabases, and assigning at least one searching task to at least one computer of a group of computers operating in parallel. Embodiments further describe designating two or more subtasks as related tasks on a virtual shared memory bulletin board, executing the at least one searching task using the at least one computer of the group of computers operating in parallel, and generating a search result responsive to the executing.

Abstract: A method for creating and executing a computer workflow using a graphical user interface. A plurality of executable components is defined wherein the executable components are based on an input, an output, metadata and a sub-interpreter. Each of the executable components represents a computer-implemented computational process that is performed on one or more inputs to the executable component and that generates one or more outputs based on a predefined computational algorithm. A graphical user interface is defined that allows a user to visually create the computer workflow on a user display by selecting from a library of said executable components. The user graphically connects one or more input terminals of selected executable components with one or more output terminals of second selected executable components.

Abstract: A method, apparatus and tangible medium for creating and executing a computer dataflow. A plurality of components is defined, each representing a computer-implemented computational process that is performed on one or more inputs and that generates one or more outputs. A graphical user interface is provided allowing a user to visually create the computer dataflow on a user display by selecting from a library of components, connecting the component's input terminals with output terminals. The input terminals graphically correspond to inputs to the component's predefined computational algorithm and the output terminals graphically correspond to outputs generated by the component's predefined computational algorithm. Without user intervention, the plurality of said selected components is distributed for execution across a plurality of machines and automatically executes upon receiving a minimum number of inputs.

Abstract: A computer-implemented method and apparatus of searching a plurality of queries against at least one database containing a plurality of records. The plurality of queries is partitioned into a set of smaller subsets of queries. Then at least one database is partioned into a set of smaller subdatabases. Searching tasks to be performed are designated by associating each of said subsets of queries with one or more of said subdatabases, assigning each searching task to one of a group of computers operating in parallel, wherein each member of the group of computers operating in parallel has at least one searching task assigned thereto, and executing at least some of the assigned searching tasks using the group of computers operating in parallel. Search results are collected from the executed searching tasks and a unified search result is generated in accordance with the collected search results.

Abstract: A computer-implemented method and apparatus of searching a plurality of queries against at least one database containing a plurality of records. The plurality of queries is partitioned into a set of smaller subsets of queries. The at least one database is portioned into a set of smaller subdatabases. Searching tasks to be performed are designated by associating each of said subsets of queries with one or more of said subdatabases, assigning each searching task to one of a group of computers operating in parallel, wherein each member of the group of computers operating in parallel has at least one searching task assigned thereto, and executing at least some of the assigned searching tasks using the group of computers operating in parallel. At least one of the searching tasks is further divided into two or more smaller searching tasks, and the two or more smaller tasks are designated as related tasks on a virtual shared memory bulletin board.

Abstract: A method, apparatus and tangible medium for creating and executing a computer dataflow. A plurality of components is defined, each representing a computer-implemented computational process that is performed on one or more inputs and that generates one or more outputs. A graphical user interface is provided allowing a user to visually create the computer dataflow on a user display by selecting from a library of components, connecting the component's input terminals with output terminals. The input terminals graphically correspond to inputs to the component's predefined computational algorithm and the output terminals graphically correspond to outputs generated by the component's predefined computational algorithm. Without user intervention, the plurality of said selected components is distributed for execution across a plurality of machines and automatically executes upon receiving a minimum number of inputs.

Abstract: A computer-implemented method and apparatus for performing remote sequence comparison. Multiple query sequences are searched against one or more sequence databases. The method includes partitioning the query sequences and partitioning the sequence databases into smaller subsets, assigning searching tasks to members of a group of computers working in parallel, each member further dividing a task into related tasks on a virtual memory shared memory bulletin board for providing high-performance and high-speed sequence comparison.

Abstract: The invention relates to a method for searching multiple query sequences against one or more sequence databases. More specifically, the invention relates to a computer-implemented method and apparatus providing high-performance, high-speed, remotely accessible sequence comparison searches.