Abstract: Provided is a method for classifying information technology (IT) service request messages. The method may include receiving data associated with an IT service request message, determining a plurality of number values associated with a plurality of characters included in the IT service request message, generating a vector that includes index values, generating a first bitmap based on generating the vector, generating a second bitmap based on the first bitmap, where the second bitmap has a first dimension and a second dimension, and where the first dimension and the second dimension are equal, and determining a classification of the IT service request message using a neural network algorithm. A system and computer program product are also disclosed.

Abstract: Provided is a method for classifying information technology (IT) service request messages. The method may include receiving data associated with an IT service request message, determining a plurality of number values associated with a plurality of characters included in the IT service request message, generating a vector that includes index values, generating a first bitmap based on generating the vector, generating a second bitmap based on the first bitmap, where the second bitmap has a first dimension and a second dimension, and where the first dimension and the second dimension are equal, and determining a classification of the IT service request message using a neural network algorithm. A system and computer program product are also disclosed.

Abstract: Provided is a method for classifying information technology (IT) service request messages. The method may include receiving data associated with an IT service request message, determining a plurality of number values associated with a plurality of characters included in the IT service request message, generating a vector that includes index values, generating a first bitmap based on generating the vector, generating a second bitmap based on the first bitmap, where the second bitmap has a first dimension and a second dimension, and where the first dimension and the second dimension are equal, and determining a classification of the IT service request message using a neural network algorithm. A system and computer program product are also disclosed.

Abstract: Provided is a method for classifying information technology (IT) service request messages. The method may include receiving data associated with an IT service request message, determining a plurality of number values associated with a plurality of characters included in the IT service request message, generating a vector that includes index values, generating a first bitmap based on generating the vector, generating a second bitmap based on the first bitmap, where the second bitmap has a first dimension and a second dimension, and where the first dimension and the second dimension are equal, and determining a classification of the IT service request message using a neural network algorithm. A system and computer program product are also disclosed.

Abstract: Methods and systems for determining amino acid sequence of a polypeptide or protein from mass spectrometry data is provided, using a weighted de Bruijn graph. Extracted and purified protein is cleaved into a mixture of peptide and then analyzed using mass spectrometry. A list of peptide sequences is derived from mass spectrometry fragment data by de novo sequencing, and amino acid confidence scores are determined from peak fragment ion intensity. A weighted de Bruijn graph is constructed for the list of peptide sequences having node weights defined by k?1 mer confidence scores. At least one contig is assembled from the de Bruijn graph by identifying node weights having the highest k?1 mer confidence scores.

Abstract: Methods and systems for determining amino acid sequence of a polypeptide or protein from mass spectrometry data is provided, using a weighted de Bruijn graph. Extracted and purified protein is cleaved into a mixture of peptide and then analyzed using mass spectrometry. A list of peptide sequences is derived from mass spectrometry fragment data by de novo sequencing, and amino acid confidence scores are determined from peak fragment ion intensity. A weighted de Bruijn graph is constructed for the list of peptide sequences having node weights defined by k?1 mer confidence scores. At least one contig is assembled from the de Bruijn graph by identifying node weights having the highest k-1 mer confidence scores.