# US 2026/0244932 A1 · System and method for amalgamation of multi-modal ai platform data via digital dna synthesis and analysis to prevent discrepancies

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2026/0244932 A1
- Document ID: US20260244932A1
- Status: Published application
- Kind: A1
- Application number: 19/055,282
- Filed: 2025-02-17
- Published: 2026-08-20
- Earliest claimed: 2025-02-17
- Assignees: Bank of America Corporation
- Applicants: Bank of America Corporation
- Inventors: Rajalakshmi Arumugam; Anusha Balasubramanian; Malini Jeyaseelan; Vishnurupa Nemili Ramachandran; Mallapragada Nagaharini
- Web page: https://patentgrep.com/patent/US20260244932A1

## CPC

- G06N 3/086: using evolutionary algorithms, e.g. genetic algorithms or genetic programming
- G06N 3/126: Evolutionary algorithms, e.g. genetic algorithms or genetic programming
- G06N 3/042: Knowledge-based neural networks; Logical representations of neural networks
- G06N 3/044: Recurrent networks, e.g. Hopfield networks
- G06N 3/045: Combinations of networks
- G06N 3/0464: Convolutional networks [CNN, ConvNet]
- G06N 3/047: Probabilistic or stochastic networks
- G06N 3/08: Learning methods
- G06N 3/088: Non-supervised learning, e.g. competitive learning
- G06N 3/09: Supervised learning
- G06N 3/12: using genetic models
- G06N 3/123: DNA computing
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 5/02: Knowledge representation; Symbolic representation
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06N 20/00: Machine learning
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

Systems, computer program products, and methods are described herein for amalgamation of multi-modal AI platform data via digital DNA synthesis and analysis to prevent discrepancies. The present disclosure includes receiving a plurality of applications for integration, scanning each application for elements, extracting embedded transformations from a fusion process used to create each respective application, identifying portions adversarial to other applications of the plurality of applications, extracting conflicting operational limits between each application, generating a plurality of digital genetic code sequences, combining corresponding digital genetic code sequences to form a digital genetic strand for each respective application, comparing each digital genetic strand to one another to result in generation of a first matrix comprising compatible sequences, converting the compatible sequences into binary data segments, and merging the binary data segments into a single unified application through an AI-assisted merger module.

## Claims

### Claim 1

A system for amalgamation of multi-modal AI platform data via digital DNA synthesis and analysis to prevent discrepancies, the system comprising:
a processing device; and
a non-transitory storage device containing instructions, when executed by the processing device, the instructions cause the processing device to perform the steps of:
receiving a plurality of applications for integration to form a merged application, wherein each application of the plurality of applications comprises a corresponding multi-modal AI application;
scanning each application of the plurality of applications for elements, wherein the elements are selected from the group consisting of code, tensors, APIs, vector databases, fusion modules, and resource managers;
extracting, for each application of the plurality of applications, by using a metaheuristic algorithm, embedded transformations from a fusion process used to create each respective application;
identifying, in each application of the plurality of applications, by using a Tensor-based Gated Graph Neural Network, portions adversarial to other applications of the plurality of applications;
extracting, from each application of the plurality of applications, by using multi-dimensional slicing, conflicting operational limits between each application of the plurality of applications;
generating a plurality of digital genetic code sequences for each application of the plurality of applications, the plurality of digital genetic code sequences comprising digital code sequences representing the elements, the embedded transformations, the portions adversarial to each other, and the conflicting operational limits for each respective application;
combining, for each application of the plurality of applications, corresponding digital genetic code sequences to form a digital genetic strand representing each respective application, resulting in a plurality of digital genetic strands;
comparing, using a graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a first matrix comprising compatible sequences;
converting the compatible sequences of the first matrix into binary data segments; and
merging the binary data segments into a single unified application through an AI-assisted merger module.

### Claim 2 (depends on 1)

The system of claim 1, wherein the instructions further cause the processing device to perform the steps of:
comparing, using the graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a second matrix comprising non-compatible sequences;
determining, through genetic algorithms comprising fitness and selection functions, solutions to conflicts in the second matrix;
remediating the conflicts of the second matrix through the solutions to the conflicts; and
converting the remediated second matrix into corresponding binary data segments.

### Claim 3 (depends on 1)

The system of claim 1, wherein the instructions further cause the processing device to perform the steps of:
comparing, using the graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a third matrix comprising partially-compatible sequences;
converting, using a codon optimizer algorithm, sequences of the third matrix into alternative sequences that are more compatible with the sequences in the first and second digital genetic strands; and
converting the alternative sequences of the third matrix into corresponding binary data segments.

### Claim 4 (depends on 1)

The system of claim 1, wherein generating the corresponding digital genetic code sequences includes applying a predefined mapping of binary code segments to quaternary digital sequences.

### Claim 5 (depends on 1)

The system of claim 1, wherein comparing, using the graph retrieval-augmented generation algorithm, each digital genetic strand to one another comprises constructing reference adjacency graphs identify compatible sequences.

### Claim 6 (depends on 1)

The system of claim 1, wherein the instructions further cause the processing device to perform the steps of:
determining, using a model classifier, a model classification for each application of the plurality of applications; and
generating a digital genetic code sequence for each application of the plurality of applications representing the model classification.

### Claim 7 (depends on 6)

The system of claim 6, wherein each digital genetic strand of the plurality of digital genetic strands comprises a respective digital genetic code sequence representing the model classification for the respective application.

### Claim 8

A computer program product for amalgamation of multi-modal AI platform data via digital DNA synthesis and analysis to prevent discrepancies, the computer program product comprising a non-transitory computer-readable medium comprising code causing an apparatus to:
receive a plurality of applications for integration to form a merged application, wherein each application of the plurality of applications comprises a corresponding multi-modal AI application;
scan each application of the plurality of applications for elements, wherein the elements are selected from the group consisting of code, tensors, APIs, vector databases, fusion modules, and resource managers;
extract, for each application of the plurality of applications, by using a metaheuristic algorithm, embedded transformations from a fusion process used to create each respective application;
identify, in each application of the plurality of applications, by using a Tensor-based Gated Graph Neural Network, portions adversarial to other applications of the plurality of applications;
extract, from each application of the plurality of applications, by using multi-dimensional slicing, conflicting operational limits between each application of the plurality of applications;
generate a plurality of digital genetic code sequences for each application of the plurality of applications, the plurality of digital genetic code sequences comprising digital code sequences representing the elements, the embedded transformations, the portions adversarial to each other, and the conflicting operational limits for each respective application;
combine, for each application of the plurality of applications, corresponding digital genetic code sequences to form a digital genetic strand representing each respective application, resulting in a plurality of digital genetic strands;
compare, using a graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a first matrix comprising compatible sequences;
convert the compatible sequences of the first matrix into binary data segments; and
merge the binary data segments into a single unified application through an AI-assisted merger module.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein the code further causes the apparatus to:
compare, using the graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a second matrix comprising non-compatible sequences;
determine, through genetic algorithms comprising fitness and selection functions, solutions to conflicts in the second matrix;
remediate the conflicts of the second matrix through the solutions to the conflicts; and
convert the remediated second matrix into corresponding binary data segments.

### Claim 10 (depends on 8)

The computer program product of claim 8, wherein the code further causes the apparatus to:
compare, using the graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a third matrix comprising partially-compatible sequences;
convert, using a codon optimizer algorithm, sequences of the third matrix into alternative sequences that are more compatible with the sequences in the first and second digital genetic strands; and
convert the alternative sequences of the third matrix into corresponding binary data segments.

### Claim 11 (depends on 8)

The computer program product of claim 8, wherein generating the corresponding digital genetic code sequences includes applying a predefined mapping of binary code segments to quaternary digital sequences.

### Claim 12 (depends on 8)

The computer program product of claim 8, wherein comparing, using the graph retrieval-augmented generation algorithm, each digital genetic strand to one another comprises constructing reference adjacency graphs identify compatible sequences.

### Claim 13 (depends on 8)

The computer program product of claim 8, wherein the code further causes the apparatus to:
determine, using a model classifier, a model classification for each application of the plurality of applications; and
generate a digital genetic code sequence for each application of the plurality of applications representing the model classification.

### Claim 14 (depends on 13)

The computer program product of claim 13, wherein each digital genetic strand of the plurality of digital genetic strands comprises a respective digital genetic code sequence representing the model classification for the respective application.

### Claim 15

A method for amalgamation of multi-modal AI platform data via digital DNA synthesis and analysis to prevent discrepancies, the method comprising:
receiving a plurality of applications for integration to form a merged application, wherein each application of the plurality of applications comprises a corresponding multi-modal AI application;
scanning each application of the plurality of applications for elements, wherein the elements are selected from the group consisting of code, tensors, APIs, vector databases, fusion modules, and resource managers;
extracting, for each application of the plurality of applications, by using a metaheuristic algorithm, embedded transformations from a fusion process used to create each respective application;
identifying, in each application of the plurality of applications, by using a Tensor-based Gated Graph Neural Network, portions adversarial to other applications of the plurality of applications;
extracting, from each application of the plurality of applications, by using multi-dimensional slicing, conflicting operational limits between each application of the plurality of applications;
generating a plurality of digital genetic code sequences for each application of the plurality of applications, the plurality of digital genetic code sequences comprising digital code sequences representing the elements, the embedded transformations, the portions adversarial to each other, and the conflicting operational limits for each respective application;
combining, for each application of the plurality of applications, corresponding digital genetic code sequences to form a digital genetic strand representing each respective application, resulting in a plurality of digital genetic strands;
comparing, using a graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a first matrix comprising compatible sequences;
converting the compatible sequences of the first matrix into binary data segments; and
merging the binary data segments into a single unified application through an AI-assisted merger module.

### Claim 16 (depends on 15)

The method of claim 15, wherein the method further comprises:
comparing, using the graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a second matrix comprising non-compatible sequences;
determining, through genetic algorithms comprising fitness and selection functions, solutions to conflicts in the second matrix;
remediating the conflicts of the second matrix through the solutions to the conflicts; and
converting the remediated second matrix into corresponding binary data segments.

### Claim 17 (depends on 15)

The method of claim 15, wherein the method further comprises:
comparing, using the graph retrieval-augmented generation algorithm, each digital genetic strand of the plurality of genetic strands to one another to result in generation of a third matrix comprising partially-compatible sequences;
converting, using a codon optimizer algorithm, sequences of the third matrix into alternative sequences that are more compatible with the sequences in the first and second digital genetic strands; and
converting the alternative sequences of the third matrix into corresponding binary data segments.

### Claim 18 (depends on 15)

The method of claim 15, wherein generating the corresponding digital genetic code sequences includes applying a predefined mapping of binary code segments to quaternary digital sequences.

### Claim 19 (depends on 15)

The method of claim 15, wherein comparing, using the graph retrieval-augmented generation algorithm, each digital genetic strand to one another comprises constructing reference adjacency graphs identify compatible sequences.

### Claim 20 (depends on 15)

The method of claim 15, wherein the method further comprises:
determining, using a model classifier, a model classification for each application of the plurality of applications; and
generating a digital genetic code sequence for each application of the plurality of applications representing the model classification.
