Sequencing and quantification of whole proteins in a sample without separation, terminal residue cleavage, or proteolysis are modeled computationally. Similar to recent work on DNA sequencing (PNAS 113, 5233-5238, 2016), a high-volume conjugate is attached to every instance of amino acid (AA) type AAi, 1 ≤ i ≤ 20, in an unfolded whole protein, which is then translocated through a nanopore. From the volume excluded by 2L residues in a pore of length L (a proxy for the blockade current), a partial sequence containing AAi is obtained. Translocation is assumed to be unidirectional, with residues exiting the pore at a roughly constant rate of ~1/μs (Nature Biotechnology 41, 1130-1139, 2023). The blockade signal is sampled at intervals of 1 μs and digitized with a step precision of 70 nm3; the positions of the AAis are obtained from the positions of well-defined quantum jumps in the signal. This procedure is applied to all 20 standard AA types, the resulting 20 partial sequences are merged to obtain the whole protein sequence. The complexity of subsequence computation is O(N) for a protein with N residues. The method is illustrated with a sample protein from the human proteome (Uniprot id UP000005640_9606). A mixture containing M unknown protein molecules (which may include multiple copies) is sequenced by mapping their partial sequences to a graph GM with 20M vertexes; GM contains M disjoint cliques of degree 20. Unlike in general clique identification (computationally an NP-hard problem) the M cliques can be obtained through a connected graph components algorithm in polynomial time. Quantification is done by sorting the M sequences on the sequence strings and counting duplicates down the sequence. The complexity of sequencing and quantification of a mixture of M proteins is O(MN). The possibility of translating this procedure into practice and related implementation issues are discussed.