Loop over a list of strings and increment letter count in a corresponding sublist

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
4
down vote

favorite












I have a 2D list as follows: 



counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, ...;


The first sub-list consists of a heading, and the following sub-lists contain counts, initialized at zero.



I need to loop over another list, sequences, that contains strings plus a heading, and access the corresponding sub-list in counts to increment the appropriate letter count.



For example, take a string from sequences:




MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEICDSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNNESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQIFLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRSGKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIFGAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEVEGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHKCDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKGNIRCNICI




Its corresponding sub-list in counts would be incremented to 31, 27, 45, 30, 18, 27, 25, 25, 42, 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25.



I obtained this via StringCount[sequences[[1]], #] & /@ counts[[1]] but am struggling to scale this code, and to make it update the sub-lists in counts instead of returning a new list.






list-manipulation numerics counting







share|improve this question























  • This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
    – briennakh
    32 mins ago










  • This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
    – briennakh
    29 mins ago














up vote
4
down vote

favorite












I have a 2D list as follows: 



counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, ...;


The first sub-list consists of a heading, and the following sub-lists contain counts, initialized at zero.



I need to loop over another list, sequences, that contains strings plus a heading, and access the corresponding sub-list in counts to increment the appropriate letter count.



For example, take a string from sequences:




MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEICDSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNNESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQIFLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRSGKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIFGAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEVEGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHKCDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKGNIRCNICI




Its corresponding sub-list in counts would be incremented to 31, 27, 45, 30, 18, 27, 25, 25, 42, 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25.



I obtained this via StringCount[sequences[[1]], #] & /@ counts[[1]] but am struggling to scale this code, and to make it update the sub-lists in counts instead of returning a new list.






list-manipulation numerics counting







share|improve this question























  • This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
    – briennakh
    32 mins ago










  • This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
    – briennakh
    29 mins ago












up vote
4
down vote

favorite









up vote
4
down vote

favorite











I have a 2D list as follows: 



counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, ...;


The first sub-list consists of a heading, and the following sub-lists contain counts, initialized at zero.



I need to loop over another list, sequences, that contains strings plus a heading, and access the corresponding sub-list in counts to increment the appropriate letter count.



For example, take a string from sequences:




MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEICDSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNNESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQIFLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRSGKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIFGAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEVEGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHKCDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKGNIRCNICI




Its corresponding sub-list in counts would be incremented to 31, 27, 45, 30, 18, 27, 25, 25, 42, 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25.



I obtained this via StringCount[sequences[[1]], #] & /@ counts[[1]] but am struggling to scale this code, and to make it update the sub-lists in counts instead of returning a new list.






list-manipulation numerics counting







share|improve this question















I have a 2D list as follows: 



counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
 0, 0, 0, 0, 0, 0, 0, 0, 0, ...;


The first sub-list consists of a heading, and the following sub-lists contain counts, initialized at zero.



I need to loop over another list, sequences, that contains strings plus a heading, and access the corresponding sub-list in counts to increment the appropriate letter count.



For example, take a string from sequences:




MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEICDSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNNESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQIFLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRSGKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIFGAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEVEGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHKCDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKGNIRCNICI




Its corresponding sub-list in counts would be incremented to 31, 27, 45, 30, 18, 27, 25, 25, 42, 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25.



I obtained this via StringCount[sequences[[1]], #] & /@ counts[[1]] but am struggling to scale this code, and to make it update the sub-lists in counts instead of returning a new list.






list-manipulation numerics counting




list-manipulation numerics counting






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited 59 mins ago

























asked 1 hour ago









briennakh

2156




2156











  • This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
    – briennakh
    32 mins ago










  • This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
    – briennakh
    29 mins ago
















  • This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
    – briennakh
    32 mins ago










  • This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
    – briennakh
    29 mins ago















This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
– briennakh
32 mins ago




This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
– briennakh
32 mins ago












This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
– briennakh
29 mins ago




This works at counting, but if I map it over all sequences as Transpose@Tally@Characters@# & /@ sequences it will output multiple headings + counts.
– briennakh
29 mins ago










3 Answers
3






active

oldest

votes

















up vote
2
down vote



accepted










You can use LetterCounts as follows:



letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", 
 "K",  "M", "F", "P", "S", "T", "W", "Y", "V"; 
sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 10, 100];
lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0] ;
counts = Join[letters, lcs];
counts // Grid


enter image description here






share|improve this answer




















  • I like the pretty output!
    – briennakh
    39 mins ago

















up vote
3
down vote













sequences = "MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEIC
DSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNN
ESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQI
FLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRS
GKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIF
GAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEV
EGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHK
CDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKG
NIRCNICI";

counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;


and the code:



new = Values[
 (CharacterCounts /@ sequences)[[All, First@counts]]
];

counts[[2 ;;]] += new;
counts



"A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", 
 "F", "P", "S", "T", "W", "Y", "V", 31, 27, 45, 30, 18, 27, 25, 42,
 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25






share|improve this answer




















  • Thank you, this works as well!
    – briennakh
    35 mins ago










  • But I would need to change the code to accommodate a list of sequences.
    – briennakh
    30 mins ago










  • @briennakh it should work in case of longer counts and sequences. If not please add examples to work with to your question
    – Kuba♦
    21 mins ago










  • This is also much faster than kglr's solution (see my post for timing examples).
    – Henrik Schumacher
    15 mins ago

















up vote
1
down vote













I can propose two things that speed up the letter counting tremendously:



1.) Use ToCharacterCode to convert your strings to packed arrays of integers.



2.) Use a compiled funcion for additive matrix assembly.



Additive assembly of each row can be obtained with this little function.



cAssembleRow = Compile[a, _Integer, 1, max, _Integer,
 Block[b,
 b = Table[0, max];
 Do[b[[Compile`GetElement[a, i]]]++, i, 1, Length[a]];
 b
 ],
 CompilationTarget -> "C",
 RuntimeAttributes -> Listable,
 Parallelization -> True,
 RuntimeOptions -> "Speed"
 ];


Borrowing a bit of code from kglr but cranking up the amount of strings and their length:



sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 1000, 1000];
letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", "F", "P", "S", "T", "W", "Y", "V";


Here is how kglr's and Kuba's very elegant solution performs:



lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0]; // RepeatedTiming // First
lcs2 = Values[(CharacterCounts /@ sequences)[[All, First@counts]]]; // RepeatedTiming // First



3.65



0.076




My version is a bit more clunky, but it does the job several times faster:



i0 = ToCharacterCode["A"][[1]] - 1;
letterpos = ToCharacterCode[StringJoin[letters]] - i0;

lcs3 = cAssemble[ToCharacterCode[sequences] - i0, 26][[All,letterpos]]; // RepeatedTiming // First
lcs == lcs2



0.0090




When all letters occur in each element of `sequences, then all results are equal:



lcs == lcs2 == lcs 3



True







share|improve this answer


















  • 1




    Henrik, if some letters have 0 count in some sequences, Kubalcs will have Missing[KeyAbsent] instead of 0; so some additional processing is needed.
    – kglr
    5 mins ago










Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "387"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: false,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f182201%2floop-over-a-list-of-strings-and-increment-letter-count-in-a-corresponding-sublis%23new-answer', 'question_page');

);

Post as a guest

















3 Answers
3






active

oldest

votes








3 Answers
3






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
2
down vote



accepted










You can use LetterCounts as follows:



letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", 
 "K",  "M", "F", "P", "S", "T", "W", "Y", "V"; 
sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 10, 100];
lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0] ;
counts = Join[letters, lcs];
counts // Grid


enter image description here






share|improve this answer




















  • I like the pretty output!
    – briennakh
    39 mins ago














up vote
2
down vote



accepted










You can use LetterCounts as follows:



letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", 
 "K",  "M", "F", "P", "S", "T", "W", "Y", "V"; 
sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 10, 100];
lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0] ;
counts = Join[letters, lcs];
counts // Grid


enter image description here






share|improve this answer




















  • I like the pretty output!
    – briennakh
    39 mins ago












up vote
2
down vote



accepted







up vote
2
down vote



accepted






You can use LetterCounts as follows:



letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", 
 "K",  "M", "F", "P", "S", "T", "W", "Y", "V"; 
sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 10, 100];
lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0] ;
counts = Join[letters, lcs];
counts // Grid


enter image description here






share|improve this answer












You can use LetterCounts as follows:



letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", 
 "K",  "M", "F", "P", "S", "T", "W", "Y", "V"; 
sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 10, 100];
lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0] ;
counts = Join[letters, lcs];
counts // Grid


enter image description here







share|improve this answer












share|improve this answer



share|improve this answer










answered 48 mins ago









kglr

161k8184384




161k8184384











  • I like the pretty output!
    – briennakh
    39 mins ago
















  • I like the pretty output!
    – briennakh
    39 mins ago















I like the pretty output!
– briennakh
39 mins ago




I like the pretty output!
– briennakh
39 mins ago










up vote
3
down vote













sequences = "MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEIC
DSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNN
ESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQI
FLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRS
GKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIF
GAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEV
EGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHK
CDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKG
NIRCNICI";

counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;


and the code:



new = Values[
 (CharacterCounts /@ sequences)[[All, First@counts]]
];

counts[[2 ;;]] += new;
counts



"A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", 
 "F", "P", "S", "T", "W", "Y", "V", 31, 27, 45, 30, 18, 27, 25, 42,
 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25






share|improve this answer




















  • Thank you, this works as well!
    – briennakh
    35 mins ago










  • But I would need to change the code to accommodate a list of sequences.
    – briennakh
    30 mins ago










  • @briennakh it should work in case of longer counts and sequences. If not please add examples to work with to your question
    – Kuba♦
    21 mins ago










  • This is also much faster than kglr's solution (see my post for timing examples).
    – Henrik Schumacher
    15 mins ago














up vote
3
down vote













sequences = "MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEIC
DSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNN
ESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQI
FLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRS
GKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIF
GAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEV
EGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHK
CDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKG
NIRCNICI";

counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;


and the code:



new = Values[
 (CharacterCounts /@ sequences)[[All, First@counts]]
];

counts[[2 ;;]] += new;
counts



"A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", 
 "F", "P", "S", "T", "W", "Y", "V", 31, 27, 45, 30, 18, 27, 25, 42,
 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25






share|improve this answer




















  • Thank you, this works as well!
    – briennakh
    35 mins ago










  • But I would need to change the code to accommodate a list of sequences.
    – briennakh
    30 mins ago










  • @briennakh it should work in case of longer counts and sequences. If not please add examples to work with to your question
    – Kuba♦
    21 mins ago










  • This is also much faster than kglr's solution (see my post for timing examples).
    – Henrik Schumacher
    15 mins ago












up vote
3
down vote










up vote
3
down vote









sequences = "MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEIC
DSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNN
ESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQI
FLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRS
GKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIF
GAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEV
EGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHK
CDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKG
NIRCNICI";

counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;


and the code:



new = Values[
 (CharacterCounts /@ sequences)[[All, First@counts]]
];

counts[[2 ;;]] += new;
counts



"A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", 
 "F", "P", "S", "T", "W", "Y", "V", 31, 27, 45, 30, 18, 27, 25, 42,
 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25






share|improve this answer












sequences = "MKTIIALSYILCLVFAQKLPGNDNSTATLCLGHHAVPNGTIVKTITNDQIEVTNATELVQSSSTGEIC
DSPHQILDGKNCTLIDALLGDPQCDGFQNKKWDLFVERSKAYSNCYPYDVPDYASLRSLVASSGTLEFNN
ESFNWTGVTQNGTSSACIRRSKNSFFSRLNWLTHLNFKYPALNVTMPNNEQFDKLYIWGVHHPGTDKDQI
FLYAQASGRITVSTKRSQQTVSPNIGSRPRVRNIPSRISIYWTIVKPGDILLINSTGNLIAPRGYFKIRS
GKSSIMRSDAPIGKCNSECITPNGSIPNDKPFQNVNRITYGACPRYVKQNTLKLATGMRNVPEKQTRGIF
GAIAGFIENGWEGMVDGWYGFRHQNSEGRGQAADLKSTQAAIDQINGKLNRLIGKTNEKFHQIEKEFSEV
EGRIQDLEKYVEDTKIDLWSYNAELLVALENQHTIDLTDSEMNKLFEKTKKQLRENAEDMGNGCFKIYHK
CDNACIGSIRNGTYDHDVYRDEALNNRFQIKGVELKSGYKDWILWISFAISCFLLCVALLGFIMWACQKG
NIRCNICI";

counts = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K",
 "M", "F", "P", "S", "T", "W", "Y", "V", 0, 0, 0, 0, 0, 0, 0, 0,
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0;


and the code:



new = Values[
 (CharacterCounts /@ sequences)[[All, First@counts]]
];

counts[[2 ;;]] += new;
counts



"A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", 
 "F", "P", "S", "T", "W", "Y", "V", 31, 27, 45, 30, 18, 27, 25, 42,
 11, 48, 44, 37, 8, 23, 20, 41, 34, 11, 19, 25







share|improve this answer












share|improve this answer



share|improve this answer










answered 47 mins ago









Kuba♦

99.7k11194492




99.7k11194492











  • Thank you, this works as well!
    – briennakh
    35 mins ago










  • But I would need to change the code to accommodate a list of sequences.
    – briennakh
    30 mins ago










  • @briennakh it should work in case of longer counts and sequences. If not please add examples to work with to your question
    – Kuba♦
    21 mins ago










  • This is also much faster than kglr's solution (see my post for timing examples).
    – Henrik Schumacher
    15 mins ago
















  • Thank you, this works as well!
    – briennakh
    35 mins ago










  • But I would need to change the code to accommodate a list of sequences.
    – briennakh
    30 mins ago










  • @briennakh it should work in case of longer counts and sequences. If not please add examples to work with to your question
    – Kuba♦
    21 mins ago










  • This is also much faster than kglr's solution (see my post for timing examples).
    – Henrik Schumacher
    15 mins ago















Thank you, this works as well!
– briennakh
35 mins ago




Thank you, this works as well!
– briennakh
35 mins ago












But I would need to change the code to accommodate a list of sequences.
– briennakh
30 mins ago




But I would need to change the code to accommodate a list of sequences.
– briennakh
30 mins ago












@briennakh it should work in case of longer counts and sequences. If not please add examples to work with to your question
– Kuba♦
21 mins ago




@briennakh it should work in case of longer counts and sequences. If not please add examples to work with to your question
– Kuba♦
21 mins ago












This is also much faster than kglr's solution (see my post for timing examples).
– Henrik Schumacher
15 mins ago




This is also much faster than kglr's solution (see my post for timing examples).
– Henrik Schumacher
15 mins ago










up vote
1
down vote













I can propose two things that speed up the letter counting tremendously:



1.) Use ToCharacterCode to convert your strings to packed arrays of integers.



2.) Use a compiled funcion for additive matrix assembly.



Additive assembly of each row can be obtained with this little function.



cAssembleRow = Compile[a, _Integer, 1, max, _Integer,
 Block[b,
 b = Table[0, max];
 Do[b[[Compile`GetElement[a, i]]]++, i, 1, Length[a]];
 b
 ],
 CompilationTarget -> "C",
 RuntimeAttributes -> Listable,
 Parallelization -> True,
 RuntimeOptions -> "Speed"
 ];


Borrowing a bit of code from kglr but cranking up the amount of strings and their length:



sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 1000, 1000];
letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", "F", "P", "S", "T", "W", "Y", "V";


Here is how kglr's and Kuba's very elegant solution performs:



lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0]; // RepeatedTiming // First
lcs2 = Values[(CharacterCounts /@ sequences)[[All, First@counts]]]; // RepeatedTiming // First



3.65



0.076




My version is a bit more clunky, but it does the job several times faster:



i0 = ToCharacterCode["A"][[1]] - 1;
letterpos = ToCharacterCode[StringJoin[letters]] - i0;

lcs3 = cAssemble[ToCharacterCode[sequences] - i0, 26][[All,letterpos]]; // RepeatedTiming // First
lcs == lcs2



0.0090




When all letters occur in each element of `sequences, then all results are equal:



lcs == lcs2 == lcs 3



True







share|improve this answer


















  • 1




    Henrik, if some letters have 0 count in some sequences, Kubalcs will have Missing[KeyAbsent] instead of 0; so some additional processing is needed.
    – kglr
    5 mins ago














up vote
1
down vote













I can propose two things that speed up the letter counting tremendously:



1.) Use ToCharacterCode to convert your strings to packed arrays of integers.



2.) Use a compiled funcion for additive matrix assembly.



Additive assembly of each row can be obtained with this little function.



cAssembleRow = Compile[a, _Integer, 1, max, _Integer,
 Block[b,
 b = Table[0, max];
 Do[b[[Compile`GetElement[a, i]]]++, i, 1, Length[a]];
 b
 ],
 CompilationTarget -> "C",
 RuntimeAttributes -> Listable,
 Parallelization -> True,
 RuntimeOptions -> "Speed"
 ];


Borrowing a bit of code from kglr but cranking up the amount of strings and their length:



sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 1000, 1000];
letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", "F", "P", "S", "T", "W", "Y", "V";


Here is how kglr's and Kuba's very elegant solution performs:



lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0]; // RepeatedTiming // First
lcs2 = Values[(CharacterCounts /@ sequences)[[All, First@counts]]]; // RepeatedTiming // First



3.65



0.076




My version is a bit more clunky, but it does the job several times faster:



i0 = ToCharacterCode["A"][[1]] - 1;
letterpos = ToCharacterCode[StringJoin[letters]] - i0;

lcs3 = cAssemble[ToCharacterCode[sequences] - i0, 26][[All,letterpos]]; // RepeatedTiming // First
lcs == lcs2



0.0090




When all letters occur in each element of `sequences, then all results are equal:



lcs == lcs2 == lcs 3



True







share|improve this answer


















  • 1




    Henrik, if some letters have 0 count in some sequences, Kubalcs will have Missing[KeyAbsent] instead of 0; so some additional processing is needed.
    – kglr
    5 mins ago












up vote
1
down vote










up vote
1
down vote









I can propose two things that speed up the letter counting tremendously:



1.) Use ToCharacterCode to convert your strings to packed arrays of integers.



2.) Use a compiled funcion for additive matrix assembly.



Additive assembly of each row can be obtained with this little function.



cAssembleRow = Compile[a, _Integer, 1, max, _Integer,
 Block[b,
 b = Table[0, max];
 Do[b[[Compile`GetElement[a, i]]]++, i, 1, Length[a]];
 b
 ],
 CompilationTarget -> "C",
 RuntimeAttributes -> Listable,
 Parallelization -> True,
 RuntimeOptions -> "Speed"
 ];


Borrowing a bit of code from kglr but cranking up the amount of strings and their length:



sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 1000, 1000];
letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", "F", "P", "S", "T", "W", "Y", "V";


Here is how kglr's and Kuba's very elegant solution performs:



lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0]; // RepeatedTiming // First
lcs2 = Values[(CharacterCounts /@ sequences)[[All, First@counts]]]; // RepeatedTiming // First



3.65



0.076




My version is a bit more clunky, but it does the job several times faster:



i0 = ToCharacterCode["A"][[1]] - 1;
letterpos = ToCharacterCode[StringJoin[letters]] - i0;

lcs3 = cAssemble[ToCharacterCode[sequences] - i0, 26][[All,letterpos]]; // RepeatedTiming // First
lcs == lcs2



0.0090




When all letters occur in each element of `sequences, then all results are equal:



lcs == lcs2 == lcs 3



True







share|improve this answer














I can propose two things that speed up the letter counting tremendously:



1.) Use ToCharacterCode to convert your strings to packed arrays of integers.



2.) Use a compiled funcion for additive matrix assembly.



Additive assembly of each row can be obtained with this little function.



cAssembleRow = Compile[a, _Integer, 1, max, _Integer,
 Block[b,
 b = Table[0, max];
 Do[b[[Compile`GetElement[a, i]]]++, i, 1, Length[a]];
 b
 ],
 CompilationTarget -> "C",
 RuntimeAttributes -> Listable,
 Parallelization -> True,
 RuntimeOptions -> "Speed"
 ];


Borrowing a bit of code from kglr but cranking up the amount of strings and their length:



sequences = StringJoin /@ RandomChoice[Capitalize@Alphabet, 1000, 1000];
letters = "A", "R", "N", "D", "C", "E", "Q", "G", "H", "I", "L", "K", "M", "F", "P", "S", "T", "W", "Y", "V";


Here is how kglr's and Kuba's very elegant solution performs:



lcs = letters /. LetterCounts /@ sequences /. Thread[letters -> 0]; // RepeatedTiming // First
lcs2 = Values[(CharacterCounts /@ sequences)[[All, First@counts]]]; // RepeatedTiming // First



3.65



0.076




My version is a bit more clunky, but it does the job several times faster:



i0 = ToCharacterCode["A"][[1]] - 1;
letterpos = ToCharacterCode[StringJoin[letters]] - i0;

lcs3 = cAssemble[ToCharacterCode[sequences] - i0, 26][[All,letterpos]]; // RepeatedTiming // First
lcs == lcs2



0.0090




When all letters occur in each element of `sequences, then all results are equal:



lcs == lcs2 == lcs 3



True








share|improve this answer














share|improve this answer



share|improve this answer








edited 1 min ago

























answered 20 mins ago









Henrik Schumacher

38.7k253114




38.7k253114







  • 1




    Henrik, if some letters have 0 count in some sequences, Kubalcs will have Missing[KeyAbsent] instead of 0; so some additional processing is needed.
    – kglr
    5 mins ago












  • 1




    Henrik, if some letters have 0 count in some sequences, Kubalcs will have Missing[KeyAbsent] instead of 0; so some additional processing is needed.
    – kglr
    5 mins ago







1




1




Henrik, if some letters have 0 count in some sequences, Kubalcs will have Missing[KeyAbsent] instead of 0; so some additional processing is needed.
– kglr
5 mins ago




Henrik, if some letters have 0 count in some sequences, Kubalcs will have Missing[KeyAbsent] instead of 0; so some additional processing is needed.
– kglr
5 mins ago

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f182201%2floop-over-a-list-of-strings-and-increment-letter-count-in-a-corresponding-sublis%23new-answer', 'question_page');

);

Post as a guest
































































Comments

Post a Comment

Popular posts from this blog

Long meetings (6-7 hours a day): Being “babysat” by supervisor

Image
Clash Royale CLAN TAG #URR8PPP .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty margin-bottom:0; up vote 31 down vote favorite 4 I hold a PhD in mechanical engineering with a 7 year background in self-guided, self-paced research including 2 years as a graduate level course instructor and a subject matter expert for various engineering projects in a university setting in the United States. For the last 10-11 months, I am working in a research industry in France where my task is to debug C++ spaghetti code written over a period of several years by my current supervisor. It is a team of 2: just I and my supervisor. Diurnally, I am posed with a "bug of the day" to get out of this C++ code. My supervisor generally gives me about 15-30 minutes to solve it and then accosts me about whether or not the task is completed and then rinses and repeats this until the end of the day. Off-late, my supervisor has been holding 6-7 hour long "meetin
Read more

Is the Concept of Multiple Fantasy Races Scientifically Flawed? [closed]

Image
Clash Royale CLAN TAG #URR8PPP up vote 2 down vote favorite Many fantasy worlds have multiple humanoid species (elves, orcs, humans, etc) living in the same world, in addition to that, they often have the ability to interbreed. And I can't help but question their believability... fantasy-races reproduction interspecies-relations share | improve this question edited Aug 9 at 14:46 Michael Kjörling ♦ 21.1k 10 85 161 asked Aug 9 at 13:13 Chlodio 118 6 closed as unclear what you're asking by MichaelK, Gryphon, John, Vincent, Frostfyre Aug 9 at 15:25 Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question. 3 Stack Exchange exist to
Read more

Confectionery

Image
Prepared foods made with a lot of sugar or other cabohydrates "Sweetmeat" redirects here. For the racehorse, see Sweetmeat (horse). Not to be confused with Sweetbread. This Kransekake is a traditional Scandinavian baker's confection. Confectionery is the art of making confections , which are food items that are rich in sugar and carbohydrates. Exact definitions are difficult. [1] In general, though, confectionery is divided into two broad and somewhat overlapping categories, bakers' confections and sugar confections. [2] Bakers' confectionery, also called flour confections , includes principally sweet pastries, cakes, and similar baked goods. Sugar confectionery includes candies ( sweets in British English), candied nuts, chocolates, chewing gum, bubble gum, pastillage, and other confections that are made primarily of sugar. In some cases, chocolate confections (confections made of chocolate) are treated as a separate category, as are sugar-free versions of
Read more