Hi @VAGR_ISK
I guess this new question is related to the previous one for which I provided a possible solution. If I understood well and based on this previous solution, I have implemented a solution here below attached.
It is based on a recursive loop because I believe you are obliged to iterate several times on the same string to gradually replace each different found Protein Name. If for instance, you have a sentence where you have 3 different Protein Names, you would need to gradually iterate 3 times in total until all the Protein Names are replaced.
The first part of the previous solution was essentially this one below:
As you can see, I have added a mock Dictionary of Protein Name Pairs, on the left the Protein Names in your sentences, on the right the new names to use as replacement.
The new added solution is as follows:
An the full new workflow is here below:
20210919 Pikairos Several replaces in the String Manipulation node.knwf (239.6 KB)
I would be glad to know if somebody else brings a more efficient solution implemented as a simpler workflow.
Maybe this solution is not exactly what you want to implement but I believe it must not be too far from it.
Hope this helps.
Best,
Ael